Submission #1113980

#TimeUsernameProblemLanguageResultExecution timeMemory
1113980stdfloatBigger segments (IZhO19_segments)C++17
37 / 100
1568 ms4020 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);
	for (int i = 0; i < n; i++)
		dp[i] = (p[i] << 1);
	for (int i = 1; i < n; i++) {
		vector<ll> u(n);
		for (int j = n - 1; j >= 0; j--)
			u[j] = min((j + 1 == n ? LLONG_MAX : u[j + 1]), dp[j]);

		int x = -1;
		for (int j = 0; j < n; j++) {
			while (x + 1 < n && u[x + 1] <= p[j]) x++;

			dp[j] = (x == -1 ? (ll)1e18 : (p[j] << 1) - p[x]);
		}

		if (dp[n - 1] == (ll)1e18) return cout << i, 0;
	}

	cout << n;
}
#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...