Submission #915062

#	Time	Username	Problem	Language	Result	Execution time	Memory
915062		penguin133	Divide and conquer (IZhO14_divide)	C++17	100 / 100	81 ms	33784 KiB

divide

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

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

struct node{
	int s, e, m, val;
	node *l, *r;
	node(int _s, int _e){
		s = _s, e = _e, m = (s + e) >> 1;
		if(s != e)l = new node(s, m), r = new node(m+1, e);
		val = -1e18;
	}
	
	void upd(int p, int v){
		if(s == e)val = max(val, v);
		else{
			if(p <= m)l->upd(p, v);
			else r->upd(p, v);
			val = max(l->val, r->val);
		}
	}
	
	int qry(int a, int b){
		if(a == s && b == e)return val;
		if(b <= m)return l->qry(a ,b);
		if(a > m)return r->qry(a, b);
		return max(l->qry(a, m), r->qry(m+1, b));
	}
}*root;

int n, A[100005], B[100005], C[100005], P[100005], P2[100005];

void solve(){
	cin >> n;
	for(int i=1;i<=n;i++)cin >> A[i] >> C[i] >> B[i];
	vector <int> v;
	for(int i=1;i<=n;i++){
		P[i] = P[i-1] + B[i];
		v.push_back(P[i - 1] - A[i]);
		v.push_back(P[i] - A[i]);
		P2[i] = P2[i-1] + C[i];
	}
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	root = new node(0, (int)v.size());
	int ans = 0;
	for(int i=1;i<=n;i++){
		int y = lower_bound(v.begin(), v.end(), P[i - 1] - A[i]) - v.begin() + 1;
		root->upd(y, -P2[i - 1]);
		int x = lower_bound(v.begin(), v.end(), P[i] - A[i]) - v.begin() + 1;
		ans = max(ans, root->qry(0, x) + P2[i]);
	}
	cout << ans << '\n';
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message (stderr)

divide.cpp:65:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   65 | main(){
      | ^~~~

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