# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671618 | smartmonky | Divide and conquer (IZhO14_divide) | C++14 | 29 ms | 3484 KiB |
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 ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
using namespace std;
const int N = 500001;
int f[N],s[N], pos[N], m[N];
int n;
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++){
int a, b, c;
cin >> a >>b >> c;
pos[i] = a;
f[i] = b + f[i - 1];
s[i] = c + s[i - 1];
m[i] = s[i] - a;
}
for (int i = n - 1; i >= 1; i--){
m[i] = max(m[i] ,m[i+1]);
}
int ans = 0;
for(int i = 1; i <= n; i++){
int l = i, r = n, res;
while(l <= r){
int mid = (l + r) >> 1;
if(s[i - 1] - pos[i] <= m[mid]){
res = mid;
l = mid + 1;
}else
r = mid - 1;
}
ans = max(ans ,f[res] - f[i-1]);
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |