#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const int MAXN = 1e5+5;
ll maxi[MAXN], pref[MAXN], prefgold[MAXN];
struct camps
{
ll x = 0, g = 0, d = 0;
} in[MAXN];
int main()
{
int n;
cin >> n;
in[0].x = in[0].g = in[0].d = 0;
ll curr = 0;
//mini[0] = 1e18;
pref[0] = 0;
prefgold[0] = 0;
for(int i = 1; i <= n; i++) {
cin >> in[i].x >> in[i].g >> in[i].d;
curr = in[i].d - (in[i].x - in[i-1].x);
// mini[i] = min(mini[i - 1], curr);
pref[i] = curr + pref[i - 1];
prefgold[i] = in[i].g + prefgold[i - 1];
}
maxi[n] = pref[n];
for(int i = n - 1; i >= 0; i--)
{
maxi[i] = maxi[i + 1];
maxi[i] = max(maxi[i+1], pref[i]);
}
// for(int i = 1; i <= n; i++)
//cout << maxi[i] << " ";
// cout << "\n";
//ll l = 1, r = 1e9;
ll ans = 0;
for(int beg = 1; beg <= n; beg++)
{
int l = beg, r = n;
while(l <= r)
{
int m = (l + r) / 2;
ll ch = maxi[m] - pref[beg];
if(ch + in[beg].d >= 0)
{
ans = max(ans, prefgold[m] - prefgold[beg - 1]);
l = m + 1;
} else
r = m - 1;
}
}
cout << ans << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
304 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
308 KB |
Output is correct |
5 |
Correct |
1 ms |
300 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
304 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
308 KB |
Output is correct |
5 |
Correct |
1 ms |
300 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
320 KB |
Output is correct |
17 |
Correct |
2 ms |
316 KB |
Output is correct |
18 |
Correct |
3 ms |
340 KB |
Output is correct |
19 |
Correct |
2 ms |
324 KB |
Output is correct |
20 |
Correct |
1 ms |
324 KB |
Output is correct |
21 |
Correct |
2 ms |
340 KB |
Output is correct |
22 |
Correct |
2 ms |
340 KB |
Output is correct |
23 |
Correct |
5 ms |
596 KB |
Output is correct |
24 |
Correct |
5 ms |
596 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
304 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
308 KB |
Output is correct |
5 |
Correct |
1 ms |
300 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
320 KB |
Output is correct |
17 |
Correct |
2 ms |
316 KB |
Output is correct |
18 |
Correct |
3 ms |
340 KB |
Output is correct |
19 |
Correct |
2 ms |
324 KB |
Output is correct |
20 |
Correct |
1 ms |
324 KB |
Output is correct |
21 |
Correct |
2 ms |
340 KB |
Output is correct |
22 |
Correct |
2 ms |
340 KB |
Output is correct |
23 |
Correct |
5 ms |
596 KB |
Output is correct |
24 |
Correct |
5 ms |
596 KB |
Output is correct |
25 |
Correct |
4 ms |
564 KB |
Output is correct |
26 |
Correct |
8 ms |
852 KB |
Output is correct |
27 |
Correct |
8 ms |
980 KB |
Output is correct |
28 |
Correct |
42 ms |
3620 KB |
Output is correct |
29 |
Correct |
51 ms |
3952 KB |
Output is correct |
30 |
Correct |
119 ms |
7780 KB |
Output is correct |
31 |
Correct |
75 ms |
6600 KB |
Output is correct |
32 |
Correct |
81 ms |
6896 KB |
Output is correct |
33 |
Correct |
73 ms |
6588 KB |
Output is correct |
34 |
Correct |
91 ms |
6588 KB |
Output is correct |
35 |
Correct |
91 ms |
7168 KB |
Output is correct |
36 |
Correct |
91 ms |
7188 KB |
Output is correct |