# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671546 | Baytoro | Divide and conquer (IZhO14_divide) | C++17 | 0 ms | 212 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 ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
void fopn(string name){
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
const int INF=1e9+9,mod=1e9+7;
int n,m;
void solve(){
cin>>n;
vector<int> x(n+1),g(n+1),d(n+1),suf(n+1);
for(int i=1;i<=n;i++)
cin>>x[i]>>g[i]>>d[i];
for(int i=1;i<=n;i++){
d[i]+=d[i-1];
g[i]+=g[i-1];
}
suf[n]=d[n]-x[n];
for(int i=n-1;i>=0;i--){
suf[i]=max(suf[i+1],d[i]-x[i]);
}
for(int i=0;i<=n;i++)
suf[i]=-suf[i];
/*for(int i=0;i<=n;i++)
cout<<suf[i]<<' ';
cout<<endl;*/
int res=0;
for(int i=1;i<=n;i++){
//cout<<x[i-1]<<endl;
int l=i,r=lower_bound(suf.begin()+1,suf.end(),-(d[i]-x[i]))-suf.begin();
res=max(g[r]-g[l-1],res);
//cout<<l<<' '<<r<<endl;
}
cout<<res;
}
main(){
ios;
int T=1;
//cin>>T;
while(T--){
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |