Submission #860736

#	Time	Username	Problem	Language	Result	Execution time	Memory
860736		Halym2007	Bigger segments (IZhO19_segments)	C++11	0 / 100	1 ms	2396 KiB

segments

#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
#define ll long long
ll o, a[N], seg[N], sum;
int op = 0;
int main () {
//	freopen("input.txt", "r", stdin);
	int n;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	o++;
	seg[o] = a[1];
	for (int i = 2; i <= n; ++i) {
//		op++;
//		if (op == 1e6) {
//			cout << "asa";
//			return 0;
//		}
		int r = i;
		sum = 0;
		while (r <= n and sum < seg[o]) {
//			op++;
//			if (op == 1e6) {
//				cout << "asa";
//				return 0;
//			}
			sum += a[r];
			r++;	
		}
		if (sum >= seg[o]) {
			o++;
			seg[o] = sum;
			while (sum - a[i] >= seg[o - 1] + a[i]) {
				seg[o - 1] += a[i];
				seg[o] -= a[i];
			}
		}
		else {
			seg[o] += sum;
		}
		i = r - 1;
	}
	cout << o << endl;
}

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