Submission #1092519

#TimeUsernameProblemLanguageResultExecution timeMemory
1092519K30_Thua_PhongK blocks (IZhO14_blocks)C++17
53 / 100
1045 ms12136 KiB
#include <bits/stdc++.h> #define ll long long #define ii pair<ll,ll> #define fi first #define se second using namespace std; const int N = 100005; ll n, k, amax = 0; ll a[N + 2], dp[N + 2][150]; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("blocks.inp", "r", stdin); //freopen("blocks.out", "w", stdout); cin >> n >> k; for(int i = 1; i <= n; i++) { cin >> a[i]; dp[i][1] = max(dp[i - 1][1], a[i]); } for(int i = 1; i <= n; i++) { for(int d = 2; d <= k; d++) dp[i][d] = INT_MAX; } for(int d = 2; d <= k; d++) { for(int i = d; i <= n; i++) { amax = a[i]; for(int j = i - 1; j >= d - 1; j--) { dp[i][d] = min(dp[i][d], dp[j][d - 1] + amax); amax = max(amax, a[j]); } } } cout << dp[n][k]; return 0; } /* 5 2 1 2 3 4 5 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...