제출 #367283

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
367283		knightron0	K개의 묶음 (IZhO14_blocks)	C++14	0 / 100	1 ms	384 KiB

blocks

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

#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double

const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #endif
    int n, k;
    cin>>n>>k;
    int a[n+3];
   	for(int i= 1;i<=n;i++){
   		cin>>a[i];
   	}
   	int dp[n+3][k+3];
   	clr(dp, 0);
   	for(int i = 1;i<=n;i++) {
   		dp[i][1] = max(dp[i-1][1], a[i]);
   	}
   	for(int j= 2;j<=k;j++){
   		for(int i= 1;i<=n;i++){
   			dp[i][j] = INF;
   			int x = 0;
   			int mx = a[i];
   			for(int ii =i-1;ii>=1;ii--){
   				dp[i][j] = min(dp[ii][j-1]+a[i], dp[i][j]);
   				if(a[ii] > a[i]){
   					x = ii;
   					break;
   				}
   			}
   			mx = max(mx, a[x]);
   			for(int ii = x-1;ii>=1;ii--){
   				dp[i][j] = min(dp[ii][j-1]+mx, dp[i][j]);
   				mx = max(mx, a[x]);
   			}

	   	}
   	}
   	cout<<dp[n][k]<<endl;
   	
    return 0;
}

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