Submission #870013

#TimeUsernameProblemLanguageResultExecution timeMemory
870013truongdoan2012K blocks (IZhO14_blocks)C++17
0 / 100
16 ms80084 KiB
#include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include "algo/debug.h" #else #define debug(...) 42 #endif using i64 = long long; const int N = 1e5 + 10; i64 dp[N][101]; // min val khi chia i phan tu vao j nhom i64 a[N]; void solve() { int n, k; cin >> n >> k; memset(dp, 0x7f7f, sizeof dp); for (int i = 1; i <= n; i++) { cin >> a[i]; } dp[0][1] = 0; for (int i = 1; i <= n; i++) { dp[i][1] = max(dp[i - 1][1], a[i]); } for (int j = 2; j <= k; j++) { for (int i = j; i <= n; i++) { for (int p = 1; p <= i; p++) { dp[i][j] = min(dp[i][j], dp[p][j - 1] + a[i]); } } } cout << dp[n][k]; } int main() { cin.tie(nullptr)->sync_with_stdio(false); int TC = 1; // cin >> TC; while (TC--) { 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...