Submission #490680

#TimeUsernameProblemLanguageResultExecution timeMemory
490680irmuunDivide and conquer (IZhO14_divide)C++17
48 / 100
1083 ms3500 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
	ll n,x[100001],g[100001],d[100001],i,j,e,m,l,r,ans;
	cin>>n;
	ans=0;
	for(i=1;i<=n;i++){
		cin>>x[i]>>g[i]>>d[i];
		if(d[i]>0){
			ans=max(ans,g[i]);
		}
	}
	for(i=1;i<=n;i++){
		e=d[i];
		m=g[i];
		l=x[i]-1;
		r=x[i];
		for(j=i+1;j<=n;j++){
			r=x[j];
			e+=d[j];
			m+=g[j];
			if(e>=r-l){
				ans=max(ans,m);
			}
		}
	}
	cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...