# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37771 | Just_Solve_The_Problem | Divide and conquer (IZhO14_divide) | C++11 | 73 ms | 5920 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>
using namespace std;
#define ll long long
const int N = (int)1e5 + 7;
ll x[N], g[N], d[N];
ll pg[N], pd[N];
main () {
int n; scanf ("%d", &n);
for (int i = 1; i <= n; i++) {
scanf ("%lld %lld %lld", x + i, g + i, d + i);
}
for (int i = 1; i <= n; i++) {
pg[i] = pg[i - 1] + g[i];
pd[i] = pd[i - 1] + d[i];
}
ll ans = 0;
int l = 1;
int r = 1;
do {
if (pd[r] - pd[l - 1] >= x[r] - x[l]) {
ans = max(ans, pg[r] - pg[l - 1]);
if (r == n) {
break;
}
r++;
} else {
l++;
}
r = min(r, n);
l = min(l, r + 1);
} while (r != n || l != n + 1);
cout << ans;
}
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... |