제출 #1130643

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1130643		zhasyn	Bigger segments (IZhO19_segments)	C++20	37 / 100	1595 ms	9028 KiB

segments

#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 5 * 1e5 + 100, M = 500 + 10, len = 315, inf = 1e18;
const ll mod = 998244353;
ll um(ll a, ll b){
	return (1LL * a * b) % mod;
}
ll subr(ll a, ll b){
	return ((1LL * a - b) % mod + mod) % mod;
}
ll bp(ll x, ll step){
	ll res = 1;
	while(step){
		if(step & 1) res = um(res, x);
		x = um(x, x);
		step /= 2;
	}
	return res;
}
ll inv(ll x){
	return bp(x, mod - 2);
}
ll a[N], dp[N], nt[N];
int main() {
	//ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);
	int n, mx = 1;
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
	}
	for(int i = 1; i <= n; i++){
		dp[i] = -1;
	}
	for(int k = 1; k <= n; k++){
		ll sum = 0, ans = -1;
		set <pll> st;
		if(k == 1) ans = 0;
		
		for(int i = 1; i <= n; i++){
			if(ans != -1) ans += a[i];
			sum += a[i];
			while((int)st.size() != 0){
				pll v = *st.begin();
				if(sum >= v.F){
					if(ans == -1) ans = sum - v.S;
					else ans = min(ans, sum - v.S);
					st.erase(st.begin());
				} else break;
			}
			if(ans != -1) nt[i] = ans;
			if(dp[i] != -1) st.insert({dp[i] + sum, sum});
		}
		
		for(int i = 0; i <= n; i++){
			if(nt[i] == 0) dp[i] = -1;
			else{
				mx = k;
				dp[i] = nt[i];
			}
			nt[i] = 0;
		}
	}
	cout << mx;
  return 0;
}

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 10 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27