Description
N个矩形,排成一排. 现在希望用尽量少的矩形海报Cover住它们.
Input
第一行给出数字N,代表有N个矩形.N在[1,250000] 下面N行,每行给出矩形的长与宽.其值在[1,1000000000]2 1/2 Postering
Output
最少数量的海报数.
Sample Input
5
1 2
1 3
2 2
2 5
1 4
![](http://www.lydsy.com/JudgeOnline/images/1113_1.jpg)
1 2
1 3
2 2
2 5
1 4
![](http://www.lydsy.com/JudgeOnline/images/1113_1.jpg)
Sample Output
4
Solve
单调栈+贪心
#include<cstdio>
int n,sta[250005],top,x,t,ans;
int main (){
scanf ("%d",&n);
for (int i=1;i<=n;++i,sta[++top]=x)
for (scanf ("%d%d",&t,&x);x<=sta[top];top--)
ans+=(x==sta[top]);
printf ("%d",n-ans);
}