Submission #88311

#	Time	Username	Problem	Language	Result	Execution time	Memory
88311		dimash241	Divide and conquer (IZhO14_divide)	C++17	17 / 100	16 ms	1400 KiB

divide

# include <stdio.h>
# include <bits/stdc++.h>


#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (int i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (int i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

using namespace std;

inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
ll x[N], g[N], d[N];
vector < ll > v;

int get_id (ll that) {
	int id = lower_bound(every(v), that) - v.begin();

	return id;
}

ll f[N], ans;

void upd (int pos, ll x) {
	while (pos > 0) {
		f[pos] = min(f[pos], x);
		pos = (pos & (pos + 1)) - 1;
	}
}

ll get (int r) {
	ll res = INF;
	for (int i = r; i <= sz(v); i |= (i + 1))
		res = min(res, f[i]);
	return res;
}

int main () {
	cin >> n;
	v.pb(0);
	int z = 0;
    
	For (i, 1, n) {
		cin >> x[i] >> g[i] >> d[i];
		g[i] += g[i - 1];
		int c = x[i] - x[i - 1];
     	z += c - d[i];
     	v.pb(z);
   	    v.pb(z + d[i]);
	}
	sort(every(v));
	v.resize(unique(every(v)) - v.begin());
	fill(f, f + sz(v) + 1, INF);
	
    z = 0;
    For (i, 1, n) {
        int c = x[i] - x[i - 1];
        z += c - d[i];

        //cout << get_id(z + d[i]) << '\n';
        upd(get_id(z + d[i]), g[i - 1]);
        //cout << get_id(z) << '\n';
        ans = max(ans, g[i] - get(get_id(z)));
    }           

    cout << ans;

    return Accepted;
}

// Coded By OB

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