Submission #222710

#	Time	Username	Problem	Language	Result	Execution time	Memory
222710		nikatamliani	Bigger segments (IZhO19_segments)	C++14	0 / 100	5 ms	384 KiB

segments

# include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N];
int main(){
	int n;
	cin >> n; 
	for(int i = 1; i <= n; i++){
		cin >> a[i];
	}
	int sum = a[1], ans = 1;
	for(int i = 2; i <= n; i++){
		int j = i, cur = 0;
		while(j <= n && sum > cur){
			cur += a[j];
			j ++;
		} --j;
		if(cur < sum){
			break;
		}
		for(int k = i; k <= j; k++){
			if(sum + a[k] <= cur - a[k]){
				sum += a[k];
				cur -= a[k]; 
			}else{
				break;
			}
		}
		sum = cur;
		ans++;
		i = j; 
	}
	cout << ans << '\n';
}

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