Submission #3010256

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

ll pref[211111];
ll x[211111];

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>x[i]>>pref[i];
	}
	for(int i=1;i<=n;i++)
	{
		pref[i]+=pref[i-1];
	}
	ll ans=0; ll mini=pref[0]-x[1];
	for(int i=1;i<=n;i++)
	{
		ans=max(ans,pref[i]-x[i]-mini);
		if(i<n) mini=min(mini,pref[i]-x[i+1]);
	}
	cout<<ans<<'\n';
}

Submission Info

Judge Result