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.

Examples

input

31 2 3

output

3

input

42 1 3 2

output

2

Note

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

题意：给你n个房子的高度，让你将他分成尽可能多的块，使得每一块都排完序后使得整体有序，问你最多能分成多少块。

题解：水题一道，我的做法是先记下所有房子的初始位置，然后按照高度排序，O（n）遍历过去。

遇到一个房子时，更新最大位置，知道可以构成一块后，在初始化mx，重复操作即可。

#include<set>      #include<map>         #include<stack>                #include<queue>                #include<vector>        #include<string>     #include<time.h>    #include<math.h>                #include<stdio.h>                #include<iostream>                #include<string.h>                #include<stdlib.h>        #include<algorithm>       #include<functional>        using namespace std;                #define ll long long          #define inf 1000000000           #define mod 1000000007                #define maxn  205000    #define lowbit(x) (x&-x)                #define eps 1e-9  int b[maxn];struct node{int x,y;}a[maxn];bool comp(node a,node b){if(a.x==b.x)return a.y<b.y;elsereturn a.x<b.x;}int main(void){int i,j,n,ans=0;scanf("%d",&n);for(i=1;i<=n;i++)scanf("%d",&a[i].x),a[i].y=i;sort(a+1,a+n+1,comp);int mx=0;for(i=1;i<=n;i++){mx=max(mx,a[i].y);if(i>=mx)ans++,mx=0;}printf("%d\n",ans);return 0;}