Submission #172958

#	Time	Username	Problem	Language	Result	Execution time	Memory
172958		LinusTorvaldsFan	Bigger segments (IZhO19_segments)	C++14	37 / 100	1570 ms	2680 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];
	vector<ll>pr(n+1);
	for(int i=0;i<n;i++)pr[i+1]=pr[i]+a[i];
	vector<int>ans(n);
	vector<ll> ans_sum(n);
	ll sum=0;
	for(int i=0;i<n;i++){
		sum+=a[i];
		ans_sum[i]=sum;
		ans[i]=1;
	}
	for(int i=0;i<n;i++){
		sum=0;
		for(int j=i;j>0;j--){
			if(pr[i+1]-pr[j]>=ans_sum[j-1]){
				if(ans[i]<ans[j-1]+1){
					ans[i]=ans[j-1]+1;
					ans_sum[i]=pr[i+1]-pr[j];
				}
				if(ans[i]==ans[j-1]+1){
					ans_sum[i]=min(ans_sum[i],pr[i+1]-pr[j]);
				}
			}
		}
	}
	cout<<ans[n-1];
	return 0;
}

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