| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1239070 | MasterDebater | 금 캐기 (IZhO14_divide) | C++20 | 0 ms | 324 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[i],zlato+=g[i];
if(energija>=x[j]-x[i])ans=max(ans,zlato);
}
}
cout<<ans;
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... | ||||
