제출 #1122742

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1122742		Chinguun	K개의 묶음 (IZhO14_blocks)	C++20	32 / 100	1095 ms	444 KiB

blocks

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

#define int long long
#define ff first
#define ss second
#define pb push_back
#define meta int tm = (tl + tr) / 2, x = i * 2 + 1, y = x + 1

const int N = 2e5 + 7;
const int oo = 1e18;
const int mod = 1e9 + 7;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;

int n, k, mn = oo, a[N];

void rec (int i, int cnt, int mx, int ans) {
	mx = max (mx, a[i]);
	// cout << i << ' ' << cnt << ' ' << mx << ' ' << ans << '\n';
	if (i == n + 1 && cnt == 0) {
		if (ans < mn) mn = ans;
		return;
	}
	if (i + cnt > n + 1 || cnt == 0) return;
	rec (i + 1, cnt, mx, ans);
	rec (i + 1, cnt - 1, 0, ans + mx);
	return;
}

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	rec (1, k, 0, 0);
	cout << mn;
	return 0;
}

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