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;
int a[101010],b[101010],c[101010];
int ans[101010],cnt[101010];
int n,mx;
int main () {
cin>>n;
for (int i=1;i<=n;i++){
cin>>a[i]>>b[i]>>c[i];
ans[i]=ans[i-1]+b[i];
cnt[i]=cnt[i-1]+c[i];
}
for (int i=1;i<=n;i++){
for (int j=i;j<=n;j++){
int q=a[j]-a[i];
int w=cnt[j]-cnt[i-1];
if (q<=w) mx=max(mx,ans[j]-ans[i-1]);
}
}
cout<<mx;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |