Submission #403181

#TimeUsernameProblemLanguageResultExecution timeMemory
403181fadi57Divide and conquer (IZhO14_divide)C++14
48 / 100
1080 ms1840 KiB
#include<bits/stdc++.h> using namespace std; const int mx=1e5+5; typedef long long ll; int inf=1e9+10; const int mod=1e9+7; int d[mx]; int g[mx]; int x[mx]; int n,m; int main(){ cin>>n; ll ans=0; for(int i=0;i<n;i++){ cin>>x[i]>>g[i]>>d[i]; // if(d[i]>=1){ans=max(ans,g[i]);} } for(int i=0;i<n;i++){ ll sum=0;ll sum2=0; for(int j=i;j<n;j++){ sum+=d[j]; sum2+=g[j]; if(x[j]-x[i]<=sum){ ans=max(ans,sum2); } } } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...