제출 #837960

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
837960		MODDI	Bigger segments (IZhO19_segments)	C++14	27 / 100	85 ms	4556 KiB

segments

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair<int,int> pii;
typedef vector<long long> vl;
typedef vector<int> vi;
ll dp[511][511];
int main(){
	int n;
	cin>>n;
	vl arr(n+1);
	for(int i = 1; i <= n; i++)	cin>>arr[i];
	
	ll pref[n+1];
	for(int i = 1; i <= n; i++)	pref[i] = pref[i-1] + arr[i];
	memset(dp, 0x3f, sizeof dp);
	dp[0][0] = 0;
	for(int i = 1; i <= 	n; i++){
		for(int j = 1; j <= i; j++){
			for(int k = i; k >= 1; k--){
				ll sum = pref[i] - pref[k-1];
				if(sum >= dp[k-1][j-1]){
					dp[i][j] = min(dp[i][j], sum);
				}
			}
		}
	}
	int ans = 0;
	for(int i = 1; i <= n; i++){
		if(dp[n][i] < 1e18 + 5)	ans = max(ans, i);
	}
	cout<<ans<<endl;
	return 0;
}

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