제출 #172687

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
172687		LinusTorvaldsFan	Bigger segments (IZhO19_segments)	C++14	0 / 100	2 ms	376 KiB

segments

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main() {
	int n;
	cin>>n;
	vector<int>a(n);
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	ll sum=0;
	int ans=1;
	for(int i=0;i<n;i++){
		sum+=a[i];
		int cur=1;
		ll cur_sum=0;
		ll prev_sum=sum;
		for(int j=i+1;j<n;j++){
			cur_sum+=a[j];
			if(cur_sum>=prev_sum){
				prev_sum=cur_sum;
				cur_sum=0;
				cur++;
			}
		}
		if(cur_sum==0)ans=max(ans,cur);
	}
	cout<<ans;
	return 0;
}

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