제출 #686975

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
686975		GudStonks	K개의 묶음 (IZhO14_blocks)	C++17	32 / 100	1073 ms	340 KiB

blocks

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ft first
#define sd second
const ll MOD = 1e9+7;
ll n, k, arr[100005];
ll rec(ll b = 0, ll i = 1, ll res = 0, ll mx = 0){
	if(i == n && b == k - 1)
		return res + max(mx, arr[i]);
	else if(i == n)
		return 2e18;
	return min((b < k - 1 ? rec(b + 1, i + 1, res + max(mx, arr[i]), 0) : (ll)2e18), rec(b, i + 1, res, max(mx, arr[i])));
}
void fun(){
	cin>>n>>k;
	for(int i = 1; i <= n; i++)cin>>arr[i];
	cout<<rec();
}

int  main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int ttt = 1;
	//cin>>ttt;
	while(ttt--)fun();
}

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