Counting problem (1) P35849


Statement
 

pdf   zip

html

Given a sequence of n integer numbers x1xn, count how many i’s, with 1 ≤ in, follow the property

| { j : 1 ≤ j ≤ n ∧ xj ≤ xi } | = i   .

Input

The input consists of several cases. Each case begins with n, followed by the n integer numbers x1xn. Assume 0 ≤ n ≤ 105.

Output

For each case, print the number of indices i that fulfill the condition above.

Public test cases
  • Input

    4   2 3 5 7
    3   -7 -7 -7
    2   2 1
    

    Output

    4
    1
    0
    
  • Information
    Author
    Salvador Roura
    Language
    English
    Official solutions
    C++
    User solutions
    C++