# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42471 | MatheusLealV | 금 캐기 (IZhO14_divide) | C++14 | 1074 ms | 4284 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.
#include <bits/stdc++.h>
#define N 100050
#define f first
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef tuple <int, int, int> trip;
ll n, sum[N], g[N], x[N], E[N], dp[N], ans;
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
cin>>n;
for(int i = 1, a, b, c; i <= n; i++)
{
cin>>x[i]>>g[i]>>E[i];
sum[i] = E[i] + sum[i - 1];
g[i] += g[i - 1];
}
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= i; j++)
{
if(sum[i] - sum[j - 1] >= x[i] - x[j])
{
ans = max(ans, g[i] - g[j - 1]);
}
}
}
cout<<ans<<"\n";
}
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... |