Submission #342892

#	Time	Username	Problem	Language	Result	Execution time	Memory
342892		IZhO_2021_I_want_Silver	K blocks (IZhO14_blocks)	C++14	53 / 100	355 ms	10220 KiB

blocks

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll

const int N = 105;
const int oo = 1e9 + 5;

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

void solve() {
    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) {
            for (int l = 1; l <= k; ++l) {
                dp[i][j][l] = oo;
            }
        }
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = i; j <= n; ++j) {
            int mx = 0;
            for (int l = i; l <= j; ++l) { mx = max(mx, a[l]); }
            dp[i][j][1] = mx;
        }
    }
    for (int len = 2; len <= n; ++len) {
        for (int l = 1; l + len - 1 <= n; ++l) {
            int r = l + len - 1;
            for (int i = 2; i <= min(len, k); ++i) {
                for (int j = l; j < r; ++j) {
                    for (int o = 1; o < i; ++o) {
                        dp[l][r][i] = min(dp[l][r][i], dp[l][j][o] + dp[j+1][r][i-o]);
                    }
                }
            }
        }
    }
    cout << dp[1][n][k];
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

Compilation message (stderr)

blocks.cpp:77:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   77 |  main () {
      |        ^

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