单调栈
P1901 发射站 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
#include "bits/stdc++.h"
#define int long long
using namespace std;
const int maxn=1e6+10;
int s1[maxn],h[maxn],v[maxn],sum[maxn],ans,n,top;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>h[i]>>v[i];
while(top&&h[s1[top]]<h[i])
sum[i]+=v[s1[top--]];
sum[s1[top]]+=v[i];
s1[++top]=i;
}
for(int i=1;i<=n;i++)
ans=max(ans,sum[i]);
cout<<ans;
return 0;
}