# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91396 | Aydarov03 | K blocks (IZhO14_blocks) | C++14 | 2 ms | 868 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int a[101] , dp[101][101];
main()
{
int n , k;
cin >> n >> k;
for(int i = 1; i <= n; i++)scanf("%d" , &a[i]);
for(int i = 1; i <= n; i++)dp[1][i] = max( a[i] , dp[1][i-1] );
for(int i = 2; i <= k; i++)
{
for(int j = i; j <= n; j++)
{
int mx = a[j];
dp[i][j] = dp[i-1][j-1] + a[j];
for(int t = j; t >= i; t--)
{
mx = max(mx , a[t]);
dp[i][j] = min( dp[i][j] , dp[i-1][t-1] + mx);
}
}
}
cout << dp[k][n];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |