Submission #859833

#TimeUsernameProblemLanguageResultExecution timeMemory
859833__Davit__K blocks (IZhO14_blocks)C++17
53 / 100
1012 ms1880 KiB
#include <bits/stdc++.h>

#define ll long long
#define lld long double
#define ff first
#define ss second
#define pb push_back
#define vr(v) v.begin(),v.end()
#define rv(v) v.rbegin(),v.rend()
#define Code ios_base::sync_with_stdio(false);
#define By cin.tie(NULL);
#define Davit cout.tie(NULL);
using namespace std;

int main() {
	int n, k;
	cin >> n >> k;
	vector<int> v(n);
	for (int i = 0; i < n; i++)cin >> v[i];
	vector<vector<int>> dp(n, vector<int>(k+5,1e9));
	int mx = v[0];
	for (int i = 0; i < n; i++) {
		mx = max(mx, v[i]);
		dp[i][1] = mx;	
	}
	for (int j = 2; j <= k; j++) {
		
		for (int i = 0; i < n; i++) {
			int X = -1e9;
			for (int l = i; l >= 1; l--) {
				X = max(X, v[l]);
				dp[i][j] = min(dp[i][j], dp[l-1][j-1] + X);
			}
		}
	}
 
	cout << dp[n - 1][k] << endl;
	
}



#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...