Submission #172725

#	Time	Username	Problem	Language	Result	Execution time	Memory
172725		LinusTorvaldsFan	Bigger segments (IZhO19_segments)	C++14	13 / 100	819 ms	10752 KiB

segments

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn=100000;

map<int,int> dp[maxn];

int main() {
	ll sum=0;
	int n;
	cin>>n;
	vector<int>a(n);
	for(int i=0;i<n;i++)cin>>a[i];
	for(int i=0;i<n;i++){
		sum+=a[i];
		dp[i][sum]=1;	
	}
	for(int i=1;i<n;i++){
		sum=0;
		for(int j=i;j>=1;j--){
			sum+=a[j];
			for(auto t:dp[j-1]){
				if(t.first<=sum){
					dp[i][sum]=max(dp[i][sum],t.second+1);
				}
			}
		}
	}
	int ans=0;
	for(auto t:dp[n-1]){
		ans=max(ans,t.second);
	}
	cout<<ans;
}

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