Record Breakers

Difficulty: 900 3500 ms 128 MB

implementation

Scanning left to right, an element is a record if it is strictly greater than everything before it (the first element is a record). Count the records.

Input: the first line has N; the second line has N integers.

Output: the number of records.

Constraints:

• 1 ≤ N ≤ 10⁵
• |a_i| ≤ 10⁹

Sample Tests

5
3 1 4 1 5

3

3
5 5 5

1

Read the Editorial