# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
170735 | juggernaut | 금 캐기 (IZhO14_divide) | C++14 | 1086 ms | 3704 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.
//Just try and the idea will come!
#include<bits/stdc++.h>
#define int long long int
using namespace std;
struct data{
int x,g,d;
};
data a[100001];
int n,i,drive[100001],gold[100001],vec[100001],res,j;
main(){
scanf("%lld",&n);
for(i=1;i<=n;i++){
scanf("%lld%lld%lld",&a[i].x,&a[i].g,&a[i].d);
gold[i]=gold[i-1]+a[i].g;
drive[i]=drive[i-1]+a[i].d;
vec[i]=drive[i]-a[i].x;
}
for(i=1;i<=n;i++){
for(j=i;j<=n;j++){
if(vec[j]>=drive[i-1]-a[i].x)res=max(res,gold[j]-gold[i-1]);
}
}
cout<<res;
}
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... |