제출 #501462

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
501462		Mazaalai	Bigger segments (IZhO19_segments)	C++17	37 / 100	1 ms	332 KiB

segments

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector <int>;
using VLL = vector <ll>;
int n, m;
const int N = 3e3 + 5;
const ll INF = 1e18;
ll pre[N], ans;
int nums[N], dp[N], par[N];
signed main () {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	cin >> n;
	m = n+1;
	for (int i = 1; i <= n; i++) cin >> nums[i];
	for (int i = 1; i <= n; i++) pre[i] += pre[i-1] + nums[i];
	for (int i = 1; i <= n; i++) {
		int p = max(par[i], par[i-1]);
		par[i] = p;
		dp[i] = dp[p]+1;
		ll b = pre[i];
		ll c = pre[p];
		ll a = 2*b-c;
		int id = lower_bound(pre, pre+m, a)-pre;
		par[id] = max(par[id], i);
	}
	ans = dp[n];
	cout << ans << '\n';
}

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