Submission #1096800

#TimeUsernameProblemLanguageResultExecution timeMemory
1096800MuhammetBigger segments (IZhO19_segments)C++17
0 / 100
1 ms436 KiB
#include <bits/stdc++.h>

using namespace std;

int main(){
	int n;
	cin >> n;
	vector <int> a(n+1);
	for(int i = 1; i <= n; i++){
		cin >> a[i];
	}
	long long l = 1, s = a[1], s1 = 0, ans = 1;
	for(int i = 2; i <= n; i++){
		s1 += a[i];
		if(s1 >= s){
			ans++;
			for(; l < i-1; l++){
				if(s+a[l+1] > s1-a[l+1]) break;
				s += a[l+1];
				s1 -= a[l+1];
			}
			s = s1;
			l = i;
			s1 = 0;
		}
	}
	cout << ans;
}
#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...