# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671557 | ReLice | 금 캐기 (IZhO14_divide) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define ld long double
#define pb push_back
#define sz size()
#define fr first
#define sc second
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const ll mod=998244353;
const ll inf=1e18;
const ll N=1e3+10;
void solve(){
ll n,m,k,i,j,l,r,i1,b,h,w,c=0,sum=0,ans=0,mx=-1,mn=inf;
cin>>n;
vector <ll> v(n),g(n),e(n),pr(n),pr2(n);
vector <pair<ll,ll>> v2;
map<ll,ll> mp;
for(i=0;i<n;i++){
cin>>v[i]>>g[i]>>e[i];
if(i==0) {pr[i]=e[i];pr2[i]=g[i];}
else {pr[i]=pr[i-1]+e[i]-(v[i]-v[i-1]);pr2[i]=pr2[i-1]+g[i];}
if(mp[pr[i]]==0 && pr[i]<0) v2.pb({pr[i],i});
mp[pr[i]]++;
}
sort(v2.begin(),v2.end());8
mp.clear();
for(i=0;i<v2.sz;i++){
mn=min(mn,v2[i].sc);
mp[v2[i].fr]=mn;
}
for(i=0;i<n;i++){
if(pr[i]>=0) mx=max(mx,pr2[i]);
else {
mx=max(mx,pr2[i]-pr2[mp[pr[i]]]+g[mp[pr[i]]]);
}
}
cout<<mx<<endl;
}
signed main(){
//fre("divide");
start();
ll t=1;
//cin>>t;
while(t--) solve();
}