Submission #1113289

#	Time	Username	Problem	Language	Result	Execution time	Memory
1113289		stdfloat	Bigger segments (IZhO19_segments)	C++17	37 / 100	1546 ms	3164 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()
 
#define ff  first
#define ss  second
#define pii pair<int, int>
 
#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--) {
			dp[j] = (ll)1e18;
 
			if (p[j] < u[0]) continue;
 
			int t = upper_bound(u.begin(), u.begin() + j, p[j]) - u.begin() - 1;
 
			dp[j] = p[j] - p[t];
			// cout << "\nj " << j << ' ' << t << ' ' << p[t] << ' ' << p[j] << ' ' << p[j] - p[t] << endl;
 
			// for (int k = j; k > 0; k--) {
			// 	if (dp[k - 1] <= p[j] - p[k - 1]) {
			// 		// cout << "k " << k << ' ' << sm << endl;
			// 		dp[j] = p[j] - p[k - 1]; break;
			// 	}
			// }
		}
 
		while (!dp.empty() && dp[0] == (ll)1e18) {
			dp.erase(dp.begin());
			p.erase(p.begin());
		}
 
		if (dp.empty() || dp.back() == (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