Submission #1321283

#TimeUsernameProblemLanguageResultExecution timeMemory
1321283nguyenBigger segments (IZhO19_segments)C++20
13 / 100
472 ms428 KiB
#include <cstdio>
#include <vector>
#include <iostream>
using namespace std;
int a[10005];
int main()
{
	int n;
	cin>>n;
	for(int i = 0; i < n; i++) cin>>a[i];
	int ans = 0;
	for(int bm = 0; bm < (1<<(n-1)); bm++)
	{
		long long cur = 0;
		vector<long long> sums;
		for(int i = 0; i < n; i++)
		{
			cur += a[i];
			if((bm & (1<<i)) > 0) 
			{
				sums.push_back(cur);
				cur = 0;
			}
		}
		sums.push_back(cur);
		bool acc = true;
		for(int j = 1; j < sums.size(); j++)
		{
			if(sums[j-1] > sums[j]) 
			{
				acc = false;
				break;
			}
		}
		int d = sums.size();
		if(acc) ans = max(ans, d);		
	}
	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...