# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
497664 | Aktan | Divide and conquer (IZhO14_divide) | C++14 | 1052 ms | 7076 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],dp[100005],dp1[100005];
main(){
int n,ans=0,res=0;
cin >> n;
for(int i=1;i<=n;i++){
cin >> a[i] >> b[i] >> c[i];
dp[i]=dp[i-1]+b[i];
dp1[i]=dp1[i-1]+c[i];
ans+=b[i];
}
int tot=0;
for(int i=1;i<=n;i++){
for(int j=n;j>=i;j--){
int k=a[j]-a[i];
if(dp1[j]-dp1[i-1]>=k){
tot=max(tot,dp[j]-dp[i-1]);
break;
}
}
}
cout << tot;
}
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... |