제출 #291154

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
291154		thiago4532	Bigger segments (IZhO19_segments)	C++17	100 / 100	82 ms	18216 KiB

segments

#include <bits/stdc++.h>
#define int int64_t

using namespace std;
const int maxn = 5e5 + 10;
typedef long long ll;
int dp[maxn], bb[maxn];
int n, v[maxn], pref[maxn];

int32_t main() {
	ios::sync_with_stdio(false), cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> v[i];
		pref[i] = pref[i-1] + v[i];
	}
	for (int i = 1; i <= n; i++) {
		bb[i] = max(bb[i], bb[i-1]);
		dp[i] = dp[ bb[i] ] + 1;

		int soma = pref[i] - pref[bb[i]];
		
		int ini = i+1, fim = n, meio, best=0;
		while (ini <= fim) {
			meio = (ini + fim) >> 1;
			if (pref[meio] - pref[i] >= soma) {
				fim = meio-1;
				best = meio;
			}else
				ini = meio+1;
		}
		bb[best] = i;
	}
	cout << dp[n] << "\n";
	return 0;
}

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