Submission #169118

#	Time	Username	Problem	Language	Result	Execution time	Memory
169118		LinusTorvaldsFan	Divide and conquer (IZhO14_divide)	C++14	17 / 100	67 ms	632 KiB

divide

#include <iostream>
#include <algorithm>

using namespace std;

const int maxn = 100000 + 7;

typedef long long ll;

int x[maxn];
int g[maxn];
int d[maxn];

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> x[i] >> g[i] >> d[i];
	}
	ll gold = 0;
	for (int i = 0; i < n; i++) {
		int supply = 0;
		ll cur = 0;
		for (int j = i; j < n; j++) {
			supply += d[j];
			cur += g[j];
			if (x[j] - x[i] <= supply) {
				gold = max(gold, cur);
			}
		}
	}
	cout << gold;
	return 0;
}

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