시간 제한  메모리 제한  제출  정답  맞은 사람  정답 비율 

3 초  512 MB  26  10  10  38.462% 
Byteasar is a programmer who works on a revolutionary text editor. In the editor there are two types of operations: one type allows to edit text in the editor, and the other type allows to undo previously performed operations. One of the innovative features of this editor is a multilevel undo operation. It works as follows. We say that a text editing operation is an operation of level 0. An undo operation of level i (for i = 1, 2, . . .) undoes the last operation of level at most i−1 which is not undone. For instance, an undo operation of level 1 can undo only editing operations, and an undo operation of level 2 can undo editing operations as well as undo operations of level 1 (but no undo operations of greater levels).
More formally, each of the already performed operations can be in two states: active or undone. Let X be one of the operations. Just after performing the operation X, it is in the state active. If X is an undo operation of level i, we find the most recent operation in state active of level at most i − 1 (denote it by X_{1}) and change the state of the operation X_{1} to undone. If X_{1} is also an undo operation, we must change to active the state of the operation which X_{1} had undone (say X_{2}). We continue in the same manner: whenever the state of an undo operation X_{j} which had previously undone some operation X_{j+1} changes, we must also change the state of the operation X_{j+1} (which, of course, may result in changing states of further operations). The whole chain of state modifications finishes when an editing operation is reached.
For simplicity, the current contents of text in the editor will be specified by a single integer s, called the editor state (equal to 0 at the beginning). Each editing operation specifies the editor state that it produces. The editor state depends on the last editing operation in the state active. Help Byteasar and write a program which keeps track of the editor state.
Let us see this in action: the following table shows some operations performed by Byteasar and the editor state after performing each of them. The symbol E_{s}
denotes an editing operation which changes the editor state to s, whereas the symbol U_{i}
denotes an undo operation of level i.
Operation  E_{1} 
E_{2} 
E_{5} 
U_{1} 
U_{1} 
U_{3} 
E_{4} 
U_{2} 
U_{1} 
U_{1} 
E_{1} 


Editor state  0  1  2  5  2  1  2  4  2  1  0  1 
First, Byteasar performed three editing operations. The editor state changed from 0 to 1, then to 2, and finally to 5. Next, he performed two undo operations of level 1, which undid the operations E_{5}
and E_{2}
(changing their state to undone). Thus the editor state was restored to 1. The following undo operation of level 3 undid the last operation U_{1}
(changing its state to undone), consequently restoring the operation E_{2}
(changing its state back to active). As a result the editor state changed once again to 2. Operation U_{2}
undid the operation E_{4}
, operation U_{1}
once again undid the restored operation E_{2}
, the last operation U_{1}
undid the operation E_{1}
, and the final operation is E_{1}
.
The first line of the input contains a positive integer n (n ≤ 300,000), specifying the number of operations performed by Byteasar. The next n lines contain descriptions of operations, one per line, each being an integer a_{i} (−n ≤ a_{i} ≤ n, a_{i} ≠ 0). If a_{i} > 0, then it specifies an editing operation which modifies the editor state to a_{i}. If a_{i} < 0, then it specifies an undo operation of level −a_{i}. You can assume that for every undo operation there will be some operation in the state active of smaller level to undo.
Your program should output n lines. The ith line should contain one integer specifying the editor state after performing the first i operations from the input.
11 1 2 5 1 1 3 4 2 1 1 1
1 2 5 2 1 2 4 2 1 0 1