Submission #1279315

#	Time	Username	Problem	Language	Result	Execution time	Memory
1279315		IBory	Divide and conquer (IZhO14_divide)	C++20	0 / 100	1 ms	1024 KiB

divide

#include <bits/stdc++.h>
#define pii pair<ll, ll>
typedef long long ll;
using namespace std;

const int MAX = 100007;
ll X[MAX], G[MAX], D[MAX];

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int N;
	cin >> N;
	for (int i = 1; i <= N; ++i) {
		cin >> X[i] >> G[i] >> D[i];
		G[i] += G[i - 1];
		D[i] += D[i - 1];
	}
	for (int i = 1; i <= N; ++i) D[i] = D[i] - X[i];

	ll ans = 0;
	set<pii> S;
	for (int i = N; i >= 0; --i) {
		if (S.empty() || (*--S.end()).first < D[i]) S.emplace(D[i], G[i]);
		auto it = S.lower_bound({D[i], 0});
		if (it != S.end()) ans = max(ans, (*it).second - (i ? G[i - 1] : 0));
	}

	cout << ans;
	return 0;
}

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