# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671567 | 2022-12-13T08:29:15 Z | Baytoro | Divide and conquer (IZhO14_divide) | C++17 | 0 ms | 212 KB |
#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; void solve(){ int n,m; 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]; int res=0; /*for(int i=1;i<=n;i++) cout<<suf[i]<<' '; cout<<endl;*/ for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ x[j]-=x[i]; d[j]-=d[i-1]; } suf[n]=d[n]-x[n]; for(int j=n-1;j>=0;j--){ suf[j]=max(suf[j+1],d[j]-x[j]); } for(int j=0;j<=n;j++) suf[j]=-suf[j]; int l=i,r=(lower_bound(suf.begin()+i,suf.end(),1)-suf.begin())-1; res=max(g[r]-g[l-1],res); } cout<<res; } main(){ ios; int T=1; //cin>>T; while(T--){ solve(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |