Submission #498789

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
498789	2021-12-26T11:01:28 Z	The_Samurai	Bigger segments (IZhO19_segments)	C++	0 / 100	1 ms	292 KB

segments

#include <bits/stdc++.h>
#define ll long long
using namespace std;

/*
3
3 1 1
*/

void solve() {
	ll n, best = 0;
	
	cin >> n;
	int a[n];
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int j = 0; j < n; j++) {
		ll s1 = 0, s2 = 0, ans = 1;
		for (int i = 0; i <= j; i++) {
			s1 += a[i];
		}
		int i = j + 1;
		while (i < n) {
			while (i < n && s1 > s2 + a[i]) {
				s2 += a[i];
				i++;
			}
			if (i == n && s1 > s2) {
				break;
			}
			s2 += a[i];
			i++;
			s1 = s2;
			s2 = 0;
			ans++;
		}
		best = max(ans, best);
	}
	cout << best;
}

int main() {
	int t = 1;
	
//	cin >> t;
	while (t--) {
		solve();
		cout << '\n';
	}
}

Subtask #1

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	0 ms	292 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	288 KB	Output is correct
6	Correct	1 ms	292 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	288 KB	Output is correct
9	Incorrect	0 ms	204 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #2

0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	0 ms	292 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	288 KB	Output is correct
6	Correct	1 ms	292 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	288 KB	Output is correct
9	Incorrect	0 ms	204 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #3

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	0 ms	292 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	288 KB	Output is correct
6	Correct	1 ms	292 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	288 KB	Output is correct
9	Incorrect	0 ms	204 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #4

0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	0 ms	292 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	288 KB	Output is correct
6	Correct	1 ms	292 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	288 KB	Output is correct
9	Incorrect	0 ms	204 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #5

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	0 ms	292 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	288 KB	Output is correct
6	Correct	1 ms	292 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	288 KB	Output is correct
9	Incorrect	0 ms	204 KB	Output isn't correct
10	Halted	0 ms	0 KB	-