Submission #210182

#	Time	Username	Problem	Language	Result	Execution time	Memory
210182		super_j6	Bigger segments (IZhO19_segments)	C++14	0 / 100	5 ms	380 KiB

segments

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define pi pair<int, int>

const int maxn = 100000;
int n;
long long a[maxn], sum[maxn];

int solve(long long x){
	long long ret = 1, s = 0;
	x = sum[x];
	for(int i = 0; i < n; i++){
		if(s >= x){
			x = s;
			s = 0;
			ret++;
		}
		s += a[i];
	}
	return ret -= (s < x);
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin >> n;
	
	for(int i = 0; i < n; i++){
		cin >> a[i];
		sum[i] = a[i] + (i ? sum[i - 1] : 0);
	} 
	
	int ret = 0;
	for(int i = 0; i < n; i++) ret = max(ret, solve(i));
	
	cout << ret << endl;

	return 0;
}

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