Submission #1150018

#	Time	Username	Problem	Language	Result	Execution time	Memory
1150018		monkey133	Cigle (COI21_cigle)	C++20	100 / 100	262 ms	212888 KiB

cigle

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
#pragma GCC optimize("O3","unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

vector<pii> to[100005];
vector<pi> upd[100005];
ll a[100005];

vector<ll> fenwick(100005,0);

ll ps(ll i)
{
	if (i==0) return 0;
	ll sum=0;
	while (i>0)
	{
		sum = max(sum, fenwick[i]);
		i-=i&(-i);
	}
	return sum;
}
void update(ll i, ll v)
{
	while (i<=100005)
	{
		fenwick[i] = max(fenwick[i], v);
		i+=i&(-i);
	}
}

int main()
{
	ll n;
	cin >> n;
	for (ll i=1; i<=n; ++i) cin >> a[i];
	for (ll i=1; i<=n; ++i)
	{
		ll l = i-1, r = i;
		ll lo = 0, hi = 0, sum = 0;
		while (l > 0 && r <= n)
		{
			if (lo + a[l] < hi + a[r]) lo += a[l--];
			else hi += a[r++];
			if (lo==hi) 
			{
				sum++;
				to[i].pb(mp(mp(l, r), sum));
			}
			
		}
		while (l > 0) 
		{
			lo += a[l--];
			if (lo==hi)
			{
				sum++;
				to[i].pb(mp(mp(l, r), sum));
			}
		}
		while (r <= n) 
		{
			hi += a[r++];
			if (lo==hi)
			{
				sum++;
				to[i].pb(mp(mp(l, r), sum));
			}
		}
	}
	ll ans = 0;
	for (ll i=1; i<=n; ++i)
	{
		//show(i);
		for (pi u: upd[i]) update(u.f, u.s);
		for (pii u: to[i])
		{
			// show3(u.f.f, u.f.s, u.s);
			ll now = ps(u.f.f) + ((u.f.f == 0 || u.f.s == n + 1)?0:u.s);
			ans = max(ans, now);
			upd[u.f.s + 1].pb(mp(i, now));
		}
	}
	cout << ans << endl;
	
	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 11 / 11
• Subtask 3: 13 / 13
• Subtask 4: 15 / 15
• Subtask 5: 52 / 52