Submission #342531

#	Time	Username	Problem	Language	Result	Execution time	Memory
342531		SeDunion	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	384 KiB

segments

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 5e5 + 55;

int a[N];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int n;
	cin >> n;
	for (int i = 1 ; i <= n ; ++ i) cin >> a[i];
	int ans = 0;
	{
		ll S = 0;
		const int K = min(n, 3000);
		for (int s = 1 ; s <= K ; ++ s) {
			S += a[s];
			int cur = 1;
			ll P = S, T = 0;
			for (int i = s + 1 ; i <= n ; ++ i) {
				T += a[i];
				if (T >= P) {
					P = T;
					T = 0;
					cur++;
				}
			}
			ans = max(ans, cur);
		}

	}
	for (int i = 1 ; i <= n ; ++ i) a[i] = -a[i];
	{
		ll S = 0;
		const int K = min(n, 3000);
		for (int s = 1 ; s <= K ; ++ s) {
			S += a[s];
			int cur = 1;
			ll P = S, T = 0;
			for (int i = s + 1 ; i <= n ; ++ i) {
				T += a[i];
				if (T <= P) {
					P = T;
					T = 0;
					cur++;
				}
			}
			ans = max(ans, cur);
		}

	}
	cout << ans;
}

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