# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37767 | 2017-12-28T05:18:25 Z | Just_Solve_The_Problem | Divide and conquer (IZhO14_divide) | C++11 | 0 ms | 5920 KB |
#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]); r++; } else { l++; } r = min(r, n); l = min(r, l); } while (r != n && l != n); ans = max(ans, g[n]); cout << ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5920 KB | Output is correct |
2 | Incorrect | 0 ms | 5920 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 5920 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 5920 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |