# 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
#include
#include
#include
#include
using namespace std;

const int N = 100001;
int a[N];
int b[N];
bool flag[N];
int n;

mapg;

int f(int val)
{
int tmp = g[ val ];
for(int j = tmp; j <= n; j++)
{
if(!flag[ j ])
{
tmp = j;break;
}
}
g[ val ] = tmp;
return tmp;
}

int main(void)
{
while(~scanf("%d", &n))
{
int i, j;
g.clear();
memset(flag, 0, sizeof(flag));
for(i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
b[i] = a[i];
}
sort(b+1, b+n+1);
for(i = 1; i <= n; i++)
{
if(!g[ b[i] ])
g[ b[i] ] = i;
}
int con = 1;
int ans = 0;
for(i = 1; i <= n; i++)
{
int tmp = f( a[i] );
flag[tmp] = 1;
if(tmp == con)
{
con++;
ans++;
}
else
{
int MAX = tmp;
int MIN = tmp;
int cnt = 1;
while(con != MIN || MAX-MIN+1 != cnt)
{
cnt++;
i++;
int tmp = f( a[i] );
flag[tmp] = 1;
MIN = min(MIN, tmp);
MAX = max(MAX, tmp);
}
ans++;
con = MAX+1;
}
}
printf("%d\n", ans);
}
return 0;
}


• 本文已收录于以下专栏：

举报原因： 您举报文章：Codeforces Round #332 (Div. 2) C. Day at the Beach 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)