#include <bits/stdc++.h>
#define N 200050
#define f first
using namespace std;
typedef long long ll;
ll cnt = 2;
ll n, sum[N], g[N], x[N], E[N], dp[N], ans, bit[N];
vector<ll> v;
map<ll, ll> mapa;
void upd(int x, ll v)
{
for(int i = x; i < N; i += (i&-i)) bit[i] = min(bit[i], v);
}
int query(int x)
{
ll sum = 2000000000000000000LL;
for(int i = x; i > 0; i -= (i&-i)) sum = min(sum, bit[i]);
return sum;
}
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
cin>>n;
for(int i = 1; i <= n; i++)
{
cin>>x[i]>>g[i]>>E[i];
sum[i] = E[i] + sum[i - 1];
g[i] += g[i - 1];
v.push_back(sum[i] - x[i]);
v.push_back(sum[i - 1] - x[i]);
}
for(int i = 0; i < N; i++) bit[i] = 2000000000000000000LL;
sort(v.begin(), v.end());
for(auto x: v) if(!mapa[x]) mapa[x] = ++cnt;
for(int i = 1; i <= n; i++)
{
upd( mapa [ sum[i - 1] - x[i] ], g[i - 1]);
ll q = g[i] - query( mapa[ sum[i] - x[i] ] );
ans = max(ans, q);
}
cout<<ans<<"\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
1912 KB |
Output is correct |
2 |
Correct |
2 ms |
1912 KB |
Output is correct |
3 |
Correct |
3 ms |
2068 KB |
Output is correct |
4 |
Correct |
3 ms |
2068 KB |
Output is correct |
5 |
Correct |
2 ms |
2144 KB |
Output is correct |
6 |
Incorrect |
2 ms |
2144 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
2144 KB |
Output is correct |
2 |
Correct |
3 ms |
2196 KB |
Output is correct |
3 |
Correct |
3 ms |
2252 KB |
Output is correct |
4 |
Correct |
3 ms |
2252 KB |
Output is correct |
5 |
Incorrect |
4 ms |
2252 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
3016 KB |
Output is correct |
2 |
Correct |
18 ms |
3912 KB |
Output is correct |
3 |
Correct |
18 ms |
3928 KB |
Output is correct |
4 |
Correct |
112 ms |
10928 KB |
Output is correct |
5 |
Correct |
119 ms |
10928 KB |
Output is correct |
6 |
Correct |
226 ms |
19404 KB |
Output is correct |
7 |
Correct |
238 ms |
19420 KB |
Output is correct |
8 |
Correct |
224 ms |
19468 KB |
Output is correct |
9 |
Correct |
226 ms |
19468 KB |
Output is correct |
10 |
Incorrect |
237 ms |
19468 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |