Codeforces Round #332 (Div. 2) C. Day at the Beach

C. Day at the Beach

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

One day Squidward, Spongebob and Patrick decided to go to the beach. Unfortunately, the weather was bad, so the friends were unable to ride waves. However, they decided to spent their time building sand castles.

At the end of the day there were n castles built by friends. Castles are numbered from 1 to n, and the height of the i-th castle is equal tohi. When friends were about to leave, Squidward noticed, that castles are not ordered by their height, and this looks ugly. Now friends are going to reorder the castles in a way to obtain that condition hi ≤ hi + 1 holds for all i from 1 to n - 1.

Squidward suggested the following process of sorting castles:

• Castles are split into blocks — groups of consecutive castles. Therefore the block from i to j will include castles i, i + 1, ..., j. A block may consist of a single castle.
• The partitioning is chosen in such a way that every castle is a part of exactly one block.
• Each block is sorted independently from other blocks, that is the sequence hi, hi + 1, ..., hj becomes sorted.
• The partitioning should satisfy the condition that after each block is sorted, the sequence hi becomes sorted too. This may always be achieved by saying that the whole sequence is a single block.

Even Patrick understands that increasing the number of blocks in partitioning will ease the sorting process. Now friends ask you to count the maximum possible number of blocks in a partitioning that satisfies all the above requirements.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of castles Spongebob, Patrick and Squidward made from sand during the day.

The next line contains n integers hi (1 ≤ hi ≤ 109). The i-th of these integers corresponds to the height of the i-th castle.

Output

Print the maximum possible number of blocks in a valid partitioning.

Sample test(s)

input

3
1 2 3

output

3

input

4
2 1 3 2

output

2

Note

In the first sample the partitioning looks like that: [1][2][3].

In the second sample the partitioning is: [2, 1][3, 2]

题意:就是给你一个序列，然后你把这个序列分为几个连续的块，每个块独自排序，最多可以分几个块最后排序后整个序列是不下降的。

思路:模拟，每个块的最小值要小于前面块的最大值，对于新的一个数，如果不大于前面的最大值就和前面的合并，同时更新前面的最大值和最小值，继续往前面更新，直到满足条件。

#include<stdio.h.>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<vector>
#include<set>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
int x[100010],mx[100010],mi[100010];
int main()
{
    int n;
    while(cin>>n)
    {
        for(int i = 1; i<=n; i++)
        {
            scanf("%d", &x[i]);
            mx[i] = x[i];
            mi[i] = x[i];
        }
        int ans = 1;
        mx[0] = -1;
        mi[0] = -1;
        id[1] = 1;
        for(int i = 2; i<=n; i++)
        {
            ans++;
            mx[ans] = x[i];
            mi[ans] = x[i];
            while(mi[ans]<mx[ans-1])
            {
                if(mi[ans] < mi[ans-1])
                    mi[ans-1] = mi[ans];
                ans--;
                mx[ans] = max(mx[ans+1],mx[ans]);
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}