제출 #369478

#제출 시각아이디문제언어결과실행 시간메모리
369478MilosMilutinovicK개의 묶음 (IZhO14_blocks)C++14
0 / 100
1 ms364 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } const int inf = (int) 1e9; vector<vector<int>> dp(n, vector<int>(k, inf)); for (int i = 0; i < n; i++) { int mx = 0; for (int j = i; j >= 0; j--) { mx = max(mx, a[j]); for (int l = 1; l < k; l++) { dp[i][l] = min(dp[i][l], dp[j][l - 1] + mx); } } dp[i][0] = min(dp[i][0], mx); } cout << dp[n - 1][k - 1] << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...