Submission #686292

#	Time	Username	Problem	Language	Result	Execution time	Memory
686292		pragmatist	K blocks (IZhO14_blocks)	C++17	53 / 100	1078 ms	4308 KiB

blocks

/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
#include<bits/stdc++.h>
 
#define sz(v) (int)v.size()
#define ll long long
#define pb push_back
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define nl "\n"

using namespace std;
using pii = pair<int, int>;

const int N = (int)1e5 + 7; // make sure this is right
const int M = (int)1e6 + 7;
const int inf = (int)1e9 + 7;
const ll INF = (ll)3e18 + 7; 
const ll MOD = (ll)1e18 + 9; // make sure this is right

bool bit(int x, int i) {
	return x >> i & 1;
}

ll sum(ll x, ll y) {
	x += y;
	if(x >= MOD) x -= MOD;
	return x;
}

int mult(int x, int y) {
	return 1ll * x * y % MOD;
}

pii dir[] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

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

void solve() {
	cin >> n >> k;
	int cur = 0;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
		cur = max(cur, a[i]);
		for(int j = 1; j <= k; ++j) {
			dp[i][j] = inf;
		}	
		dp[i][1] = cur;
	}
	dp[0][0] = 0;
	for(int i = 1; i <= k; ++i) dp[0][i] = inf;
	for(int j = 2; j <= k; ++j) {
		for(int i = j; i <= n; ++i) {
			cur = 0;
			for(int l = i; l >= 1; --l) {
				cur = max(cur, a[l]);
				dp[i][j] = min(dp[i][j], dp[l - 1][j - 1] + cur);
			}	
		}
	}             
	/*
	for(int j = 1; j <= k; ++j) {
		for(int i = 1; i <= n; ++i) {
			cout << dp[i][j] << ' ';
		}
		cout << "\n";
	}
	*/
	cout << dp[n][k];
}

signed main() {	
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int test = 1;
	//cin >> test;
	for(int i = 1; i <= test; ++i) {
	 	//cout << "Case #" << i << ": ";
		solve();
	}
	return 0;
}

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