Submission #17453

#	Time	Username	Problem	Language	Result	Execution time	Memory
17453		azecoder	Divide and conquer (IZhO14_divide)	C++98	48 / 100	1000 ms	4060 KiB

divide

#include <iostream>

#define MAXN 100005
#define intt long long

using namespace std ;

intt n , gold[MAXN] , en[MAXN] , ans , x[MAXN] ;

int main () {
	
	cin >> n ;
	
	for ( int i = 1 ; i <= n ; i ++ ) {
		
		cin >> x[i] >> gold[i] >> en[i] ;
		
		gold[i] += gold[i - 1] ;
		
		en[i] += en[i - 1] ;
				
	}
	
	for ( int i = 1 ; i <= n ; i ++ ) {
		
		for ( int j = i ; j <= n ; j ++ ) {
			
			if ( en[j] - en[i - 1] >= x[j] - x[i] ) ans = max ( ans , gold[j] - gold[i - 1] ) ;
				
		}
			
	}
	
	cout << ans << endl ;
	
	return 0 ;
		
}

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