bzoj1113: [Poi2008]海报PLA

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <algorithm>
 6 #define maxn 250005
 7 using namespace std;
 8 
 9 int n,top,stack[maxn],ans;
10 
11 int main(){
12     int u,v;
13     scanf("%d",&n);
14     top=ans=0,memset(stack,0,sizeof(stack));
15     for (int i=1;i<=n;i++){
16         scanf("%d%d",&u,&v);
17         while (top&&stack[top]>v) top--;
18         stack[++top]=v;
19         if (stack[top]!=stack[top-1]) ans++;
20     }
21     printf("%d\n",ans);
22     return 0;
23 }