//poj 3044
//sep9
#include <iostream>
#include <stack>
using namespace std;
const int MAXN=80000;
int x,y[MAXN];
int main()
{
int n,w;
while(scanf("%d%d",&n,&w)==2){
for(int i=0;i<n;++i){
scanf("%d%d",&x,&y[i]);
}
y[n]=0;
stack<int> st;
int ans=0;
st.push(0);
for(int i=0;i<=n;++i){
while(!st.empty()&&st.top()>y[i]){
st.pop();
++ans;
}
if(y[i]!=st.top())
st.push(y[i]);
}
printf("%d\n",ans);
}
}
poj 3044 City Skyline 单调栈
最新推荐文章于 2021-08-01 01:17:32 发布