제출 #1156544

#제출 시각아이디문제언어결과실행 시간메모리
1156544kadirK blocks (IZhO14_blocks)C++20
53 / 100
1093 ms2864 KiB
#include<bits/stdc++.h>
#define int long long
#define ss second
#define ff first
#define pb push_back
const int mxn=30005;
using namespace std;
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n,k;
    cin>>n>>k;
    int a[n+5];
    for(int i=1; i<=n; i++) {
        cin>>a[i];
    }
    int dp[n+5][k+5];
    for(int i=0; i<=n; i++) {
        for(int j=0; j<=k; j++){
            dp[i][j]=1e18;
        }
    }
    dp[0][0]=0;
    for(int r=1; r<=n; r++) {
        int mx=0;
        for(int l=r;l>=1; l--) {
            mx=max(mx,a[l]);
            for(int i=1; i<=k; i++) {
                dp[r][i]=min(dp[r][i],dp[l-1][i-1]+mx);
            }
        }
    }
    cout<<dp[n][k];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...