This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define f0(i, n) for(int i=(0); i<n; i++)
#define f1(i, n) for(int i=(1); i<=n; i++)
using namespace std;
typedef long long ll;
const int N = 1e5 + 3;
int n;
ll x[N], g[N], d[N], ma[N], sum[N];
main(){
ios_base::sync_with_stdio(0);
cin >> n;
f1(i, n) cin >> x[i] >> g[i] >> d[i];
f1(i, n) d[i] += d[i - 1];
f1(i, n) sum[i] = sum[i - 1] + g[i];
ma[0] = 1e17;
f1(i, n){
ma[i] = d[i - 1] - x[i];
}
f1(i, n) ma[i] = min(ma[i], ma[i - 1]);
ll res = 0;
f1(i, n){
ll t = d[i] - x[i];
int l = 1, r = i - 1, ans = 0;
while(l <= r){
int mid = (l + r)/2;
if(ma[mid] <= t) r = mid - 1, ans = mid;
else l = mid + 1;
}
res = max(res, g[i]);
if(ans){
res = max(res, sum[i] - sum[ans - 1]);
}
}
cout << res;
}
Compilation message (stderr)
divide.cpp:12:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main(){
^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |