Submission #36388

#	Time	Username	Problem	Language	Result	Execution time	Memory
36388		cheater2k	Divide and conquer (IZhO14_divide)	C++14	17 / 100	3 ms	8584 KiB

divide

#include <bits/stdc++.h>
using namespace std;

const int N = 200005;

int n;
long long x[N], g[N], d[N];
long long T[N];
long long ans;
vector<long long> z; // for compression

void upd(int x, long long val) { for(; x < N; x += x & -x) T[x] = max(T[x], val); }
long long get(int x) { long long res = 0; for (; x > 0; x -= x & -x) res = max(res, T[x]); return res; }

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n; ++i) cin >> x[i] >> g[i] >> d[i], d[i] += d[i-1]; // (coordinate, gold, energy)
	for (int i = 1; i <= n; ++i) {
		// compress all values
		z.push_back(d[i] - x[i]);
		z.push_back(d[i-1] - x[i]);
	}
	sort(z.begin(), z.end());
	z.resize(distance(z.begin(), unique(z.begin(), z.end())));

	for (int i = 1; i <= n; ++i) {
		long long dp = g[i];
		int pos = lower_bound(z.begin(), z.end(), d[i] - x[i]) - z.begin() + 1;
		dp += get(pos);
		pos = lower_bound(z.begin(), z.end(), d[i-1] - x[i]) - z.begin() + 1;
		upd(pos, dp);
		ans = max(ans, dp);
	}

	cout << ans << endl;
}

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