/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e14;
const ld Pi = acos(-1);
ll s, n, m, k, ans, pos[N], e[N], gg[N], tree[4 *N];
ll find(ll xx, int lx, int rx, int x){
//cout<<lx<<" "<<rx<<" "<<tree[x]<<" "<<xx<<" "<<tree[x*2]<<" "<<tree[x*2+1]<<endl;
if(lx == rx) return lx;
int m = (lx + rx)>>1;
if(tree[x*2+1] >= xx) return find(xx, m+1, rx, x*2+1);
else return find(xx, lx, m, x*2);
}
void solve(){
cin>>n;
s = 1;
while(s < n) s<<=1;
memset(tree, -inf, sizeof tree);
for(int i=1;i<=n;i++){
cin>>pos[i]>>gg[i]>>e[i];
umax(ans, gg[i]);
e[i] += e[i-1];
gg[i] += gg[i-1];
tree[i+s-1] = e[i] - pos[i];
}
for(int i=s-1;i>=1;i--) tree[i] = max(tree[i<<1], tree[(i<<1)+1]);
for(int i=1;i<=n;i++){
ll cur = e[i-1] - pos[i];
ll in = find(cur, 1, s, 1);
//cout<<i<<" "<<in<<endl;
umax(ans, gg[in] - gg[i-1]);
}cout<<ans<<"\n";
return;
}
/*
4
0 5 1
1 7 2
4 4 1
7 15 3
*/
int main(){
fastios
int t = 0;
if(!t) solve();
else {
cin>>t;
while (t--) solve();
}
return 0;
}
Compilation message
divide.cpp: In function 'void solve()':
divide.cpp:46:15: warning: overflow in conversion from 'long long int' to 'int' changes value from '-100000000000000' to '-276447232' [-Woverflow]
46 | memset(tree, -inf, sizeof tree);
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
6636 KB |
Output is correct |
| 2 |
Incorrect |
4 ms |
6636 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
6636 KB |
Output is correct |
| 2 |
Incorrect |
4 ms |
6636 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
6636 KB |
Output is correct |
| 2 |
Incorrect |
4 ms |
6636 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
