Submission #1265548

#TimeUsernameProblemLanguageResultExecution timeMemory
1265548rayan_bdK개의 묶음 (IZhO14_blocks)C++20
53 / 100
1095 ms3140 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main(){ ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); int n, k; cin >> n >> k; vector<int> a(n + 1); for(int i = 1; i <= n; ++i) cin >> a[i]; vector<vector<int>> dp(n + 1, vector<int> (k + 1, 1e18)); dp[0][0] = 0; for(int i = 1; i <= n; ++i){ int mx = 0; for(int j = i; j >= 1; --j){ mx = max(mx, a[j]); for(int blk = 1; blk <= k; ++blk){ dp[i][blk] = min(dp[i][blk], dp[j - 1][blk - 1] + mx); } } } cout << dp[n][k] << "\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...