<s>
Dynamic	B-General_Concept
problems	I-General_Concept
in	O
computational	O
complexity	O
theory	O
are	O
problems	O
stated	O
in	O
terms	O
of	O
the	O
changing	O
input	O
data	O
.	O
</s>
<s>
The	O
overall	O
set	O
of	O
computations	O
for	O
a	O
dynamic	B-General_Concept
problem	I-General_Concept
is	O
called	O
a	O
dynamic	B-General_Concept
algorithm	I-General_Concept
.	O
</s>
<s>
Incremental	O
algorithms	O
,	O
or	O
online	B-Algorithm
algorithms	I-Algorithm
,	O
are	O
algorithms	O
in	O
which	O
only	O
additions	O
of	O
elements	O
are	O
allowed	O
,	O
possibly	O
starting	O
from	O
the	O
empty/trivial	O
input	O
data	O
.	O
</s>
<s>
Dynamic	B-General_Concept
problem	I-General_Concept
For	O
an	O
initial	O
set	O
of	O
N	O
numbers	O
,	O
dynamically	O
maintain	O
the	O
maximal	O
one	O
when	O
insertion	O
and	O
deletions	O
are	O
allowed	O
.	O
</s>
<s>
A	O
well-known	O
solution	O
for	O
this	O
problem	O
is	O
using	O
a	O
self-balancing	B-Data_Structure
binary	I-Data_Structure
search	I-Data_Structure
tree	I-Data_Structure
.	O
</s>
<s>
The	O
priority	B-Application
queue	I-Application
maintenance	O
problem	O
It	O
is	O
a	O
simplified	O
version	O
of	O
this	O
dynamic	B-General_Concept
problem	I-General_Concept
,	O
where	O
one	O
requires	O
to	O
delete	O
only	O
the	O
maximal	O
element	O
.	O
</s>
