bzoj 1628: [Usaco2007 Demo]City skyline 单调队列

题意

分析

sb题。只要维护一个单调递增的单调队列即可。

代码

#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>using namespace std;int q[50005];int main(){    int w,n;    scanf("%d%d",&n,&w);    int head=1,tail=1,ans=0;    for (int i=1;i<=n;i++)    {        int x,y;        scanf("%d%d",&x,&y);        while (head<=tail&&q[tail]>y) tail--;        if (y!=q[tail]) ans++,q[++tail]=y;    }    printf("%d",ans);    return 0;}