Submission #671914

#TimeUsernameProblemLanguageResultExecution timeMemory
671914moday_morningK blocks (IZhO14_blocks)C++17
53 / 100
101 ms95160 KiB
#include <bits/stdc++.h> #define int long long using namespace std; const int MAXX = 1e18 + 3; int n, k, dp[10000][10000]; void solve () { cin >> n >> k; vector <int> a(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i]; fill(dp[i], dp[i] + 200, 1e18); } dp[0][0] = 0; for (int i = 1; i <= n; i++) { for (int l = 1; l <= k; l++) { int mx = 0; for (int j = i; j >= 1 && j >= l; j--) { mx = max(mx, a[j]); dp[i][l] = min(dp[i][l], dp[j - 1][l - 1] + mx); } } } cout << dp[n][k] << "\n"; } signed main() { // usaco("triangles"); ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; // cin >> t; while (t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...