Submission #526278

#	Time	Username	Problem	Language	Result	Execution time	Memory
526278		CursedCode	Bigger segments (IZhO19_segments)	C++14	13 / 100	1 ms	684 KiB

segments

#include<bits/stdc++.h>

using namespace std;

int main(){
	int n,i,a[100000],j;
	cin >> n;
	for(i = 1;i <= n;i++){
		cin >> a[i];
	}
	int dp[n+1],cnt[n+1];
	dp[1] = a[1];
	dp[0] = 0;
	cnt[0] = 0;
	cnt[1] = 1;
	for(i = 2;i <= n;i++){
		int ol = 0;
		for(j = i;j >= 1;j--){
			ol+= a[j];
			if(ol >= dp[j-1]){
				cnt[i] = cnt[j-1] + 1;
				break;
			}
		}
		dp[i] = ol;
	}
	cout << cnt[n];
}

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