제출 #1232209

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1232209		PlayVoltz	K개의 묶음 (IZhO14_blocks)	C++20	53 / 100	1092 ms	2888 KiB

blocks

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, k;
	cin>>n>>k;
	vector<int> vect(n+1);
	vector<vector<int> > dp(n+1, vector<int>(k+1, LLONG_MAX/2));
	dp[0][0]=0;
	for (int i=1; i<=n; ++i)cin>>vect[i];
	for (int i=1; i<=n; ++i)for (int j=1; j<=k; ++j)for (int p=i-1, mx=vect[i]; p>=j-1; --p)dp[i][j]=min(dp[i][j], dp[p][j-1]+mx), mx=max(mx, vect[p]);
	cout<<dp[n][k];
}

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