Submission #707561

#	Time	Username	Problem	Language	Result	Execution time	Memory
707561		emptypringlescan	Bigger segments (IZhO19_segments)	C++17	37 / 100	1570 ms	3388 KiB

segments

#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	long long arr[n],pref[n+1];
	for(int i=0; i<n; i++) cin >> arr[i];
	pref[0]=0;
	for(int i=0; i<n; i++){
		pref[i+1]=pref[i]+arr[i];
	}
	pair<int,long long> dp[n+1];
	dp[0]={0,0};
	for(int i=1; i<=n; i++){
		for(int j=i; j>0; j--){
			if(pref[i]-pref[j-1]>=dp[j-1].second){
				dp[i]={dp[j-1].first+1LL,pref[i]-pref[j-1]};
				break;
			}
		}
	}
	cout << dp[n].first;
	return 0;
}

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