[BZOJ 1657][Usaco2006 Mar]Mooo 奶牛的歌声：单调栈

点击这里查看原题

做两次单调栈，栈里存序号

/*
User:Small
Language:C++
Problem No.:1657
*/
#include<bits/stdc++.h>
#define ll long long
#define inf 999999999
using namespace std;
const int M=5e4+5;
int n,h[M],c[M],ans,sum[M],s[M],tp;
int main(){
    freopen("data.in","r",stdin);//
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d%d",&h[i],&c[i]);
    for(int i=1;i<=n;i++){
        while(tp&&h[s[tp]]<=h[i]) tp--;
        if(tp) sum[s[tp]]+=c[i];
        s[++tp]=i;
    }
    tp=0;
    for(int i=n;i;i--){
        while(tp&&h[s[tp]]<=h[i]) tp--;
        if(tp) sum[s[tp]]+=c[i];
        s[++tp]=i;
    }
    for(int i=1;i<=n;i++) ans=max(ans,sum[i]);
    printf("%d\n",ans);
    return 0;
}