Submission #861428

#	Time	Username	Problem	Language	Result	Execution time	Memory
861428		Halym2007	Bigger segments (IZhO19_segments)	C++11	13 / 100	1 ms	2484 KiB

segments

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 5e5 + 5;
ll dp[N], p[N], a[N], val[N];

int main () {
//	freopen("input.txt", "r", stdin);
	int n;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
		p[i] = a[i] + p[i - 1];
	}
	for (int i = 1; i <= n; ++i) {
		int l = 1;
		int r = i;
		int jog = 0;
		while (l <= r) {
			int md = (l + r) / 2;
			if (p[i] - p[md - 1] >= val[md - 1]) {
				jog = md;
				l = md + 1;
			}
			else r = md - 1;
		}
		dp[i] = dp[jog - 1] + 1;
		val[i] = p[i] - p[jog - 1];
	}
	cout << dp[n];
}

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