Submission #1239121

#	Time	Username	Problem	Language	Result	Execution time	Memory
1239121		MasterDebater	K개의 묶음 (IZhO14_blocks)	C++20	53 / 100	1 ms	328 KiB

blocks

#include<bits/stdc++.h>
using namespace std;
int n,k,a[105],dp[105][105];
int solve(int i,int j){
	if(j>k)return 1e9;
	if(i==n){
		if(j==k)return 0;
		return 1e9;
	}
	if(dp[i][j]==-1){
		dp[i][j]=1e9;
		int mx=0;
		for(int q=i;q<n;q++){
			mx=max(mx,a[q]);
			dp[i][j]=min(dp[i][j],mx+solve(q+1,j+1));
		}
	}
	return dp[i][j];
}
int main(){
	cin>>n>>k;
	for(int i=0;i<n;i++)cin>>a[i];
	for(int i=0;i<105;i++)for(int j=0;j<105;j++)dp[i][j]=-1;
	cout<<solve(0,0);
	return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 18 / 18
• Subtask 3: 21 / 21
• Subtask 4: 0 / 47