# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
80964 | farukkastamonuda | Divide and conquer (IZhO14_divide) | C++14 | 1078 ms | 18332 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 fi first
#define se second
#define lo long long
#define inf 1000000000
#define md 1000000007
#define li 100005
#define mp make_pair
#define pb push_back
using namespace std;
int n;
lo int x[li], g[li], d[li], sume[li], sumg[li], cev;
bool check(int val, int beg){
if(x[val] - x[beg] <= sume[val] - sume[beg - 1]) return true;
return false;
}
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i ++){
scanf("%lld %lld %lld", &x[i], &g[i], &d[i]);
sume[i] = sume[i - 1] + d[i];
sumg[i] = sumg[i - 1] + g[i];
}
for(int i = 1; i <= n; i ++){
int bas = i, son = n;
while(bas <= son){
int mid = (bas + son) / 2;
if(check(mid, i)) bas = mid + 1;
else son = son - 1;
}
cev = max(cev, sumg[son] - sumg[i - 1]);
}
printf("%lld\n", cev);
return 0;
}
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... |