제출 #1239071

#제출 시각아이디문제언어결과실행 시간메모리
1239071MasterDebaterDivide and conquer (IZhO14_divide)C++20
48 / 100
1093 ms1604 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long const int N=2e5+10; ll n,ans,x[N],g[N],d[N]; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cin>>n; for(int i=0;i<n;i++)cin>>x[i]>>g[i]>>d[i]; for(int i=0;i<n;i++){ ll energija=0, zlato=0; for(int j=i;j<n;j++){ energija+=d[j],zlato+=g[j]; if(energija>=x[j]-x[i])ans=max(ans,zlato); } } cout<<ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...