D. 【CSP-J模拟赛六】--D承接工程

NBS

#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm> 
using namespace std;
long long top=0,n,num=0,i,j,k,stack[250100];
int main(){
    cin>>n;
    for(i=1;i<=n;++i){
        cin>>j>>k;
        while(top>0&&k<=stack[top]){
            if(k==stack[top])num++;
            --top;
        }
        stack[++top]=k;
    }
    cout<<n-num;
    return 0;
}