제출 #42476

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
42476		MatheusLealV	Divide and conquer (IZhO14_divide)	C++14	0 / 100	238 ms	19468 KiB

divide

#include <bits/stdc++.h>
#define N 200050
#define f first
using namespace std;
typedef long long ll;

ll cnt = 2;

ll n, sum[N], g[N], x[N], E[N], dp[N], ans, bit[N];

vector<ll> v;

map<ll, ll> mapa;

void upd(int x, ll v)
{
	for(int i = x; i < N; i += (i&-i)) bit[i] = min(bit[i], v);
}

int query(int x)
{
	ll sum = 2000000000000000000LL;

	for(int i = x; i > 0; i -= (i&-i)) sum = min(sum, bit[i]);

	return sum;
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	cin>>n;

	for(int i = 1; i <= n; i++)
	{
		cin>>x[i]>>g[i]>>E[i];

		sum[i] = E[i] + sum[i - 1];

		g[i] += g[i - 1];

		v.push_back(sum[i] - x[i]);

		v.push_back(sum[i - 1] - x[i]);
	}

	for(int i = 0; i < N; i++) bit[i] = 2000000000000000000LL;

	sort(v.begin(), v.end());

	for(auto x: v) if(!mapa[x]) mapa[x] = ++cnt;

	for(int i = 1; i <= n; i++)
	{
		upd( mapa [ sum[i - 1] - x[i] ], g[i - 1]);

		ll q = g[i] - query( mapa[ sum[i] - x[i] ] );

		ans = max(ans, q);
	}

	cout<<ans<<"\n";
}

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