제출 #991701

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
991701		VMaksimoski008	K개의 묶음 (IZhO14_blocks)	C++17	53 / 100	1050 ms	2396 KiB

blocks

#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int32_t main() {
    int n, k;
    cin >> n >> k;

    vector<int> v(n+1);
    for(int i=1; i<=n; i++) cin >> v[i];

    ll dp[n+1][k+1];
    for(int i=0; i<=n; i++)
        for(int j=0; j<=k; j++) dp[i][j] = 1e18;

    dp[0][0] = 0;
    for(int i=1; i<=n; i++) {
        for(int j=1; j<=k; j++) {
            int mx = 0;
            for(int x=i; x>=1; x--) {
                mx = max(mx, v[x]);
                dp[i][j] = min(dp[i][j], dp[x-1][j-1] + mx);
            }
        }
    }

    cout << dp[n][k] << '\n';
    return 0;
}

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