제출 #1113999

#제출 시각아이디문제언어결과실행 시간메모리
1113999stdfloatBigger segments (IZhO19_segments)C++17
37 / 100
1560 ms3408 KiB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

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

	int n;
	cin >> n;

	vector<int> a(n);
	for (auto &i : a)
		cin >> i;

	vector<ll> p(n);
	for (int i = 0; i < n; i++)
		p[i] = (i ? p[i - 1] : 0) + a[i];

	vector<ll> dp(n), v(n);
	dp[0] = 1; v[0] = a[0];
	for (int i = 1; i < n; i++) {
		dp[i] = dp[i - 1]; v[i] = v[i - 1] + a[i];

		for (int j = i - 1; j >= 0 && dp[i] <= dp[j] + 1; j--) {
			if (v[j] <= p[i] - p[j]) {
				v[i] = min((dp[i] == dp[j] + 1 ? v[i] : LLONG_MAX), p[i] - p[j]);
				dp[i] = dp[j] + 1;
				break;
			}
		}
	}

	cout << dp[n - 1];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...