Submission #210192

#TimeUsernameProblemLanguageResultExecution timeMemory
210192super_j6Bigger segments (IZhO19_segments)C++14
0 / 100
5 ms376 KiB
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define pi pair<int, int>

const int maxn = 500000;
int n;
long long a[maxn];

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

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

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...