제출 #1113290

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

segments

#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
 
#define sz(v)	(int)(v).size()
#define all(v)	(v).begin(), (v).end()
 
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 = p;
	for (int i = 1; i < n; i++) {
		vector<ll> u(sz(dp));
		for (int j = sz(dp) - 1; j >= 0; j--)
			u[j] = min((j + 1 == sz(dp) ? LLONG_MAX : u[j + 1]), dp[j] + p[j]);
 
		for (int j = sz(dp) - 1; j >= 0; j--) {
			if (p[j] < u[0]) dp[j] = (ll)1e18;
			else dp[j] = p[j] - p[upper_bound(u.begin(), u.begin() + j, p[j]) - u.begin() - 1];
		}
 
		if (dp[n - 1] == (ll)1e18) return cout << i, 0;
	}
 
	cout << n;
}

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