Submission #174296

#	Time	Username	Problem	Language	Result	Execution time	Memory
174296		Dovran	Divide and conquer (IZhO14_divide)	C++11	0 / 100	17 ms	632 KiB

divide

#include<bits/stdc++.h>
using namespace std;
int main(){
	
	int n;
	cin>>n;
	int sum[n]={0}, x[n], g[n], d[n];
	for(int i=0; i<n; i++){
		cin>>x[i]>>g[i]>>d[i];
	}
	sum[0]=g[0]; int mem=d[0];
	for(int i=1; i<n; i++){
		if(d[i] + mem >= x[i]) mem+=d[i], sum[i]=sum[i-1];
		else mem=d[i];
		sum[i]=sum[i]+g[i];
	}
	mem=sum[0];
	for(int i=1; i<n; i++) mem=max(mem,sum[i]);
	cout<<mem<<endl;
}

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