#include <cstdio>
#include <algorithm>
typedef long long ll;
using namespace std;
const int N = 100001;
int a[N], m = 0, n, bit[N];
ll b[N], c[N], cp[N];
inline int pos(ll x){ return upper_bound(cp, cp+m, x) - cp;}
int qry(int i){ int res = n+1; for(; i; i-=i&-i) res = min(res, bit[i]); return res;}
void upd(int i, int v){ for(; i<=m; i+=i&-i) bit[i] = min(bit[i], v);}
signed main(){
scanf("%d", &n);
for(int i = 1; i<=n; ++i){
scanf("%d %lld %lld", a+i, b+i, c+i);
b[i] += b[i-1]; c[i] += c[i-1];
cp[m++] = c[i-1] - a[i];
}
sort(cp, cp+m); m = unique(cp, cp+m) - cp;
fill(bit, bit+m+1, n+1);
ll mx = 0;
for(int i = 1; i<=n; ++i){
upd(pos(c[i-1] - a[i]), i);
int j = qry(pos(c[i] - a[i]));
if(j <= n) mx = max(mx, b[i] - b[j-1]);
}
printf("%lld", mx);
}
Compilation message
divide.cpp: In function 'int main()':
divide.cpp:13:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
13 | scanf("%d", &n);
| ~~~~~^~~~~~~~~~
divide.cpp:15:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
15 | scanf("%d %lld %lld", a+i, b+i, c+i);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
0 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
348 KB |
Output is correct |
| 18 |
Correct |
1 ms |
436 KB |
Output is correct |
| 19 |
Correct |
1 ms |
348 KB |
Output is correct |
| 20 |
Correct |
1 ms |
348 KB |
Output is correct |
| 21 |
Correct |
1 ms |
360 KB |
Output is correct |
| 22 |
Correct |
1 ms |
348 KB |
Output is correct |
| 23 |
Correct |
2 ms |
604 KB |
Output is correct |
| 24 |
Correct |
2 ms |
696 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
0 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
348 KB |
Output is correct |
| 18 |
Correct |
1 ms |
436 KB |
Output is correct |
| 19 |
Correct |
1 ms |
348 KB |
Output is correct |
| 20 |
Correct |
1 ms |
348 KB |
Output is correct |
| 21 |
Correct |
1 ms |
360 KB |
Output is correct |
| 22 |
Correct |
1 ms |
348 KB |
Output is correct |
| 23 |
Correct |
2 ms |
604 KB |
Output is correct |
| 24 |
Correct |
2 ms |
696 KB |
Output is correct |
| 25 |
Correct |
2 ms |
604 KB |
Output is correct |
| 26 |
Correct |
3 ms |
860 KB |
Output is correct |
| 27 |
Correct |
3 ms |
832 KB |
Output is correct |
| 28 |
Correct |
15 ms |
2872 KB |
Output is correct |
| 29 |
Correct |
15 ms |
3164 KB |
Output is correct |
| 30 |
Correct |
33 ms |
6228 KB |
Output is correct |
| 31 |
Correct |
28 ms |
5212 KB |
Output is correct |
| 32 |
Correct |
31 ms |
5212 KB |
Output is correct |
| 33 |
Correct |
29 ms |
4952 KB |
Output is correct |
| 34 |
Correct |
30 ms |
4912 KB |
Output is correct |
| 35 |
Correct |
31 ms |
5468 KB |
Output is correct |
| 36 |
Correct |
37 ms |
5640 KB |
Output is correct |
