Submission #161224

#	Time	Username	Problem	Language	Result	Execution time	Memory
161224		MohamedAhmed04	Divide and conquer (IZhO14_divide)	C++14	48 / 100	1074 ms	2552 KiB

divide

#include <bits/stdc++.h>

using namespace std ;

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	int n ;
	cin>>n ;
	long long a[n] , e[n] , v[n] ;
	for(int i = 0 ; i < n ; ++i)
		cin>>a[i]>>v[i]>>e[i] ;
	long long ans = 0ll ;
	for(int i = 0 ; i < n ; ++i)
	{
		long long sum1 = 0ll , sum2 = 0ll ;
		for(int j = i ; j < n ; ++j)
		{
			sum1 += e[j] , sum2 += v[j] ;
			if(a[j]-a[i] <= sum1)
				ans = max(ans , sum2) ;
		}
	}
	return cout<<ans<<"\n" , 0 ;
}

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