Elevator Log

Difficulty: 900 3000 ms 128 MB

implementation

An elevator starts at floor 0 and makes N relative moves. Print the final floor, the lowest floor reached, and the highest floor reached.

Input: the first line has N; the second line has the N moves (positive up, negative down).

Output: three integers: final, lowest, highest.

Constraints:

• 1 ≤ N ≤ 10⁵
• |move| ≤ 10

Sample Tests

4
3 -5 2 1

1 -2 3

1
-2

-2 -2 0

Read the Editorial Statistics