Submission #403180

#	Time	Username	Problem	Language	Result	Execution time	Memory
403180		fadi57	Divide and conquer (IZhO14_divide)	C++14	17 / 100	3 ms	332 KiB

divide

#include<bits/stdc++.h>
using namespace std;
const int mx=1002;
typedef long long ll;
int inf=1e9+10;
const int mod=1e9+7;
int d[mx];
int g[mx];
int x[mx];
int n,m;

int main(){
cin>>n;
ll ans=0;
for(int i=0;i<n;i++){
    cin>>x[i]>>g[i]>>d[i];
   // if(d[i]>=1){ans=max(ans,g[i]);}
}

for(int i=0;i<n;i++){
        ll sum=0;ll sum2=0;
    for(int j=i;j<n;j++){
        sum+=d[j];
        sum2+=g[j];
if(x[j]-x[i]<=sum){
    ans=max(ans,sum2);
}

    }
}
cout<<ans;
 }

• Subtask 1: 17 / 17
• Subtask 2: 0 / 31
• Subtask 3: 0 / 52