# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
497646 | Aktan | Divide and conquer (IZhO14_divide) | C++14 | 0 ms | 204 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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long
#define ft first
#define sc second
using namespace std;
const int mod=1e9+7,INF=1e17;
int a[100005],b[100005],c[100005];
main(){
ifstream fin("divide.in");
ofstream fout("divide.out");
int n;
fin >> n;
for(int i=0;i<n;i++){
fin >> a[i] >> b[i] >> c[i];
}
int l=0,r=0,dist=0,ans=0,res=0,tot=0;
while(r<n){
tot+=c[r];
ans+=b[r];
if(r==0){
r++;
continue;
}
else{
while(a[r]-a[l]>tot){
tot-=c[l];
ans-=b[l];
l++;
}
}
res=max(res,ans);
r++;
}
fout << res;
}
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... |