Submission #167762

#	Time	Username	Problem	Language	Result	Execution time	Memory
167762		Gurban	Divide and conquer (IZhO14_divide)	C++11	48 / 100	1078 ms	5240 KiB

divide

#include <bits/stdc++.h>

#define pb push_back
#define ss second
#define ff first
#define N 100005
#define inf 1000000009
#define ll long long
#define mid(a,b) (a+b)/2

using namespace std;

int n;
ll x[N],g,e;
ll dis[N],gold[N],jog,mx;

int main()
{
	cin >> n;
	for(int i = 1;i <= n;i++){
		cin >> x[i] >> g >> e;
		gold[i] = gold[i - 1] + g;
		dis[i] = dis[i - 1] + e;
		for(int j = 1;j <= i;j++){
			if(x[i] - x[j] <= dis[i] - dis[j - 1]){
				jog = gold[i] - gold[j - 1];
				break;
			}
		}
		mx = max(jog,mx);
	}
	cout << mx;
}

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