Submission #1181370

#	Time	Username	Problem	Language	Result	Execution time	Memory
1181370		karrigan	K blocks (IZhO14_blocks)	C++17	53 / 100	1 ms	1552 KiB

blocks

#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back
#define ii pair<int, int>
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 1000, K = 1000, mod = 1e9+7, inf = 1e18;

int n, k;
int a[N];
int dp[N][K];
int mx[N][N];

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];
    for (int i=1; i<=n; i++) {
        for (int j=i; j<=n; j++) {
            if(i==j) mx[i][j] = a[i];
            else mx[i][j] = max(mx[i][j-1], a[j]);
        }
    }
    for (int i=0; i<=n; i++) {
        for (int j=0; j<=k; j++) dp[i][j] = inf;
    }
    for (int i=1; i<=n; i++) dp[i][1] = mx[1][i];
    for (int j=2; j<=k; j++) {
        for (int i=j; i<=n; i++) {
            for (int l=1; l<i; l++) {
                dp[i][j] = min(dp[i][j], dp[l][j-1]+mx[l+1][i]);
            }
        }
    }
    cout << dp[n][k];
}

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