Peak Occupancy

Difficulty: 900 3000 ms 128 MB

implementation

A log records cars entering (I) and leaving (O) an initially empty car park (the log is consistent). Print the maximum number of cars present at once.

Input: the first line has N; the second line has the N events separated by spaces.

Output: the peak occupancy.

Constraints:

• 1 ≤ N ≤ 10⁵

Sample Tests

6
I I O I I O

3

1
I

1

Read the Editorial