Submission #3760765

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll zb[100010],pri[100010];
int main(){
	ll n,now=0,ans=0;
	cin>>n;
	for(int i=0;i<n;++i)cin>>zb[i]>>pri[i];
	for(int i=0;i<n;++i){
		for(int j=0;j<=i;++j){
			for(int k=j;k<=i;++k)now+=pri[k];
			ans=max(ans,now-(zb[i]-zb[j]));
			now=0;
		}
	}
	cout<<ans;
	return 0;
}

Submission Info

Judge Result