제출 #1140725

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1140725		Nurislam	Bigger segments (IZhO19_segments)	C++20	13 / 100	24 ms	2376 KiB

segments

#include <bits/stdc++.h> 
using namespace std;

#define int long long
const int inf = 2e9;

signed main(){
	
	int n; cin >> n;
	
	vector<int> a(n);
	for(int &i : a) cin >> i;
	
	vector<int> pr{0};
	for(int i : a)pr.push_back(pr.back() + i);
	
	
	vector<vector<int>> dp(n+1, vector<int> (n + 1,inf));
	dp[0][0] = 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j <= i; j++){
			int la = dp[i][j];
			for(int to = i+1; to <= n; to++){
				if(pr[to] - pr[i] >= la){
					dp[to][j+1] = min(dp[to][j+1], pr[to]-pr[i]);
				}
			}
		}
	}
	
	for(int i = n; i >= 0; i--)
		if(dp[n][i] != inf)
			return cout << i << '\n', 0;
	
};

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