Submission #1022853

#	Time	Username	Problem	Language	Result	Execution time	Memory
1022853		yellowtoad	Bigger segments (IZhO19_segments)	C++17	0 / 100	0 ms	348 KiB

segments

#include <iostream>
using namespace std;

long long n, a[500010], l, r, lst, cnt, sum;

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	l = r = 1;
	sum = a[1];
	while (r <= n) {
		if (sum < lst) sum += a[++r];
		else {
			while ((l < r) && (sum-a[l] >= lst+a[l])) {
				lst += a[l];
				sum -= a[l++];
			}
			lst = sum;
			cnt++;
			l = ++r;
			sum = a[r];
		}
	}
	cout << cnt << endl;
}

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