bzoj 1628: [Usaco2007 Demo]City skyline【贪心+单调栈】
2018-05-04 21:56
483 查看
还以为是dp呢
首先默认答案是n
对于一个影子,如果前边的影子比它高则可以归进前面的影子,高处的一段单算;
和他一样高的话就不用单算了,ans--;
否则入栈
#include<iostream> #include<cstdio> #include<algorithm> using namespace std; const int N=50005; int n,m,ans,top,h ,s ; int read() { int r=0,f=1; char p=getchar(); while(p>'9'||p<'0') { if(p=='-') f=-1; p=getchar(); } while(p>='0'&&p<='9') { r=r*10+p-48; p=getchar(); } return r*f; } int main() { n=read(),m=read(); for(int i=1;i<=n;i++) h[i]=read(),h[i]=read(); ans=n; for(int i=1;i<=n;i++) { while(s[top]>h[i]) top--; if(s[top]==h[i]) ans--; else s[++top]=h[i]; } printf("%d",ans); return 0; }
相关文章推荐
- 贪心-BZOJ-1628-[Usaco2007 Demo]City skyline
- 【BZOJ】1628 && 1683: [Usaco2007 Demo]City skyline 城市地平线(单调栈)
- [单调栈] BZOJ 1113 [Poi2008]海报PLA & BZOJ 1628 [Usaco2007 Demo]City skyline
- 1628: [Usaco2007 Demo]City skyline (单调栈)
- [bzoj] 1628: [Usaco2007 Demo]City skyline
- bzoj 1628 && 1683: [Usaco2007 Demo]City skyline(模拟)
- 【BZOJ】1628 [Usaco2007 Demo]City skyline 单调栈
- BZOJ 1628: [Usaco2007 Demo]City skyline
- BZOJ 1628: [Usaco2007 Demo]City skyline
- bzoj1628【Usaco2007 Demo】City skyline
- [BZOJ1628]=[BZOJ1683][Usaco2007 Demo]City skyline
- bzoj 1628: [Usaco2007 Demo]City skyline 单调队列
- BZOJ_1628_[Usaco2007_Demo]_City_skyline_(单调栈)
- 【BZOJ1628】【USACO2007 Demo】City Skyline
- [Usaco2007 Demo][BZOJ1628] City skyline
- BZOJ1628: [Usaco2007 Demo]City skyline
- bzoj 1629: [Usaco2007 Demo]Cow Acrobats(贪心排序)
- 【BZOJ】1629: [Usaco2007 Demo]Cow Acrobats(贪心+排序)
- 【刷水-贪心】BZOJ1629-[Usaco2007 Demo]Cow Acrobats
- bzoj 1629: [Usaco2007 Demo]Cow Acrobats【贪心+排序】