CodeForces 599C Day at the Beach

描述：输入n个整型数据，要求对数据分块，要求分块后对每块数据排序的结果和对所有n个数据排序的结果是相同的。思路很简单，可以分析出一个性质是：本分组的数据最大值一定小于本组后的所有数据最小值。然后分别用两个数组ma[ ], mi[ ]映射n个数据保存前最大值，后最小值，比较输出即可。刚开始做的时候是想着用数据截取判断呢！不过超时了，超时的代码也在下面，思路正确，但是时间复杂度是真的高了。

问题：

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 to h_i. 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 h_i ≤ h_i + 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 h_i, h_i + 1, ..., h_j becomes sorted.
• The partitioning should satisfy the condition that after each block is sorted, the sequence h_i 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 h_i (1 ≤ h_i ≤ 10⁹). 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]

正确题解：

    
    

     
     /****************************************
    
    

    
    

     
      * Author: alei
    
    

    
    

     
      * Created Time: 2015
    
    

    
    

     
      * project name:11.27.周赛 C
    
    

    
    

     
     *****************************************/
    
    


    
    

     
     #include
     
      
     
     <iostream>
    
    

    
    

     
     #include
     
      
     
     <stdio.h>
    
    

    
    

     
     #include
     
      
     
     <stdlib.h>
    
    

    
    

     
     #include
     
      
     
     <string>
    
    

    
    

     
     #include
     
      
     
     <stack>
    
    

    
    

     
     #include
     
      
     
     <queue>
    
    

    
    

     
     #include
     
      
     
     <algorithm>
    
    

    
    

     
     #include
     
      
     
     <math.h>
    
    


    
    

     
     using
     
      
     
     namespace
     
      std
     
     ;
    
    


    
    

     
     #define
     
      MAX_SIZE 
     
     100005
    
    


    
    

     
     int
     
      n
     
     ,
     
      counter
     
     ;
     
     //数据量，和结果计数器
    
    

    
    

     
     int
     
      d
     
     [
     
     MAX_SIZE
     
     ];
    
    

    
    

     
     int
     
      ma
     
     [
     
     MAX_SIZE
     
     ],
     
      mi
     
     [
     
     MAX_SIZE
     
     ];
     
     //存放之前最大值之后最小值
    
    
    
    

     
     

    
    

    
    

    
    

     
     int
     
      
     
     main
     
     ()
    
    

    
    

     
     {
    
    

    
    

     
         
     
     while
     
     (
     
      cin 
     
     >>
     
      n 
     
     )
    
    

    
    

     
         
     
     {
    
    

    
    

     
             
     
     for
     
     (
     
     int
     
      i
     
     =
     
     0
     
     ;
     
      i
     
     <
     
     n
     
     ;
     
      i
     
     ++)
    
    

    
    

     
                 cin
     
     >>
     
     d
     
     [
     
     i
     
     ];
    
    

    
    

     
             ma
     
     [
     
     0
     
     ]
     
      
     
     =
     
      d
     
     [
     
     0
     
     ];
    
    

    
    

     
             
     
     for
     
     (
     
     int
     
      i
     
     =
     
     1
     
     ;
     
      i
     
     <
     
     n
     
     ;
     
      i
     
     ++)
     
     //之前最大值
    
    

    
    

     
             
     
     {
    
    

    
    

     
                 ma
     
     [
     
     i
     
     ]
     
      
     
     =
     
      
     
     max
     
     (
     
     d
     
     [
     
     i
     
     ],
     
      ma
     
     [
     
     i
     
     -1
     
     ]);
    
    

    
    

     
             
     
     }
    
    

    
    

     
             mi
     
     [
     
     n
     
     -1
     
     ]
     
      
     
     =
     
      d
     
     [
     
     n
     
     -1
     
     ];
    
    

    
    

     
             
     
     for
     
     (
     
     int
     
      i
     
     =
     
     n
     
     -2
     
     ;
     
      i
     
     >=
     
     0
     
     ;
     
      i
     
     --)
     
     //之后最小值
    
    

    
    

     
             
     
     {
    
    

    
    

     
                 mi
     
     [
     
     i
     
     ]
     
      
     
     =
     
      
     
     min
     
     (
     
     d
     
     [
     
     i
     
     ],
     
      mi
     
     [
     
     i
     
     +1
     
     ]);
    
    

    
    

     
             
     
     }
    
    

    
    

     
             counter 
     
     =
     
      
     
     1
     
     ;
    
    

    
    

     
             
     
     for
     
     (
     
     int
     
      i
     
     =
     
     0
     
     ;
     
      i
     
     <
     
     n
     
     -1
     
     ;
     
      i
     
     ++)
    
    

    
    

     
                 
     
     if
     
     (
     
     ma
     
     [
     
     i
     
     ]
     
      
     
     <=
     
      mi
     
     [
     
     i
     
     +1
     
     ])
    
    

    
    

     
                     counter
     
     ++;
    
    

    
    

     
             cout
     
     <<
     
     counter
     
     <<
     
     endl
     
     ;
    
    

    
    

     
         
     
     }
    
    


    
    

     
        
     
     return
     
      
     
     0
     
     ;
    
    
 

    
    

     
     }
    
    
    
    

     
     第一次的超时代码：（求大神优化）
    
    
    
    

     
     /****************************************
 * Author: alei
 * Created Time: 2015
 * project name:11.27.周赛 C
*****************************************/


#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <stack>
#include <queue>
#include <algorithm>


using namespace std;


#define MAX_SIZE 100005


int h[MAX_SIZE];
int n;
int counter;


bool ziPan(int a[], int b[], int f, int e)
{
    int t_size = e-f+1;
    int temp[t_size];
    for(int i=0, j=f; i<t_size; i++, j++)
    {
        temp[i] = a[j];
    }
    sort(temp, temp + t_size);
    for(int i=0, j=f; i<t_size; i++, j++)
    {
        if(temp[i] != b[j])
            {
                return 0;
            }
    }
    return 1;
}
int main()
{
    while( scanf("%d", &n) != EOF )
    {
        counter = 0;
        for(int i=0; i<n; i++)
        {
            scanf("%d", &h[i]);
        }
        int h_sor[n];
        for(int i=0; i<n; i++)
        {
            h_sor[i] = h[i];
        }
        sort(h_sor, h_sor+n);
        int fir_flag = 0;
        int end_flag = 0;
        for(int i=0; i<n; i++)
        {
            end_flag = i;
            if(ziPan(h, h_sor, fir_flag, end_flag) == 1)
            {
                counter++;
                fir_flag = end_flag+1;
            }
        }
        cout<< counter <<endl;
    }
    return 0;
}