Submission #344668

#	Time	Username	Problem	Language	Result	Execution time	Memory
344668		Erzhan06	Divide and conquer (IZhO14_divide)	C++14	48 / 100	1079 ms	876 KiB

divide

#include <bits/stdc++.h>
using namespace std;
#define nl "\n"
#define bananas return 0;
#define ll long long
#define IOS ios_base :: sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
const int N=2e5+6;
const int INF=1e9+6;
int main() {
IOS
	ll n;
	cin>>n;
	int x[n+1],g[n+1],e[n+1];
	for (int i=1;i<=n;i++) {
		cin>>x[i]>>g[i]>>e[i];
	}
	ll mx=-1;
	for(int i=1;i<=n;i++) {
		ll energy=0;
		ll point=0;
		ll gold=0;
		for (int j=i;j<=n;j++) {
			energy+=e[j];
			point=x[j]-x[i];
			if (energy>=point) {
				gold+=g[j];
				mx=max(gold,mx);
			}else {
			    gold+=g[j];
			}
		}
	}
	cout<<mx;
bananas
 
}

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