Submission #31754

#TimeUsernameProblemLanguageResultExecution timeMemory
31754aomeK blocks (IZhO14_blocks)C++14
53 / 100
0 ms2220 KiB
#include <bits/stdc++.h> using namespace std; const int N = 105; const int INF = 1e9; int n, m, a[N], f[N][N]; int main() { ios::sync_with_stdio(false); cin >> n >> m; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 0; i <= m; ++i) for (int j = 0; j <= n; ++j) f[i][j] = INF; f[0][0] = 0; for (int i = 1; i <= m; ++i) { for (int j = 1; j <= n; ++j) { int mx = 0; for (int k = j; k >= 1; --k) { mx = max(mx, a[k]); f[i][j] = min(f[i][j], f[i - 1][k - 1] + mx); } } } cout << f[m][n]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...