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

原创 2015年11月21日 10:43:15
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;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

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 ...

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 ...

【Codeforces Round 326 (Div 2)D】【DP】Duff in Beach 数列重复取数最多k次使得单调不下降

D. Duff in Beach time limit per test 2 seconds memory limit per test 256 megabytes ...

Codeforces Round #375 (Div. 2) C Polycarp at the Radio

C. Polycarp at the Radio time limit per test 2 seconds memory limit per test 256 megabytes ...

Codeforces Round #375 (Div. 2) C. Polycarp at the Radio 贪心+排序

贪心+排序 刚开始的时候理解题意错了,以为最小值尽可能大,最大值尽可能小, 但其实是中间贪心的过程中把最大值的 cnt[m-1].b的乐队变成最小值的乐队 cnt[0].b,直到 cnt[0].cnt...

【Codeforces Round 375 (Div 2) C】【语文题】Polycarp at the Radio

C. Polycarp at the Radio time limit per test 2 seconds memory limit per test 256 megabyt...

Codeforces Round #375 (Div. 2) -- C. Polycarp at the Radio(水题)

大体题意: 给你n 个数,要求1~m每个数出现次数的最小值尽可能大,要求你修改n个数,要改的次数尽可能小,输出最小值的最大可能和最少修改次数,并把改的数组输出出来! 思路: 开始没看到次数尽可能...

Codeforces Round #375 (Div. 2)C. Polycarp at the Radio

Codeforces Round #375 (Div. 2)C. Polycarp at the Radio   一道分析题 1,仔细分以后易得,对于给定的n与m,min {bj,1  因为我们要保证...

Codeforces Round #332 (Div. 2) A. Patrick and Shopping

A. Patrick and Shopping time limit per test 1 second memory limit per test 256 megabytes...

【Codeforces Round 332 (Div 2)D】【数学 公式推导】Spongebob and Squares 正方形数量恰好为x个的所有大矩形

D. Spongebob and Squares time limit per test 2 seconds memory limit per test 256 megabyt...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)