# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
238068 | luciocf | K blocks (IZhO14_blocks) | C++14 | 10 ms | 4736 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>
#define ff first
#define ss second
using namespace std;
typedef pair<int, int> pii;
const int maxn = 1e5+10;
const int maxk = 110;
const int inf = 1e9+10;
int n, k;
int a[maxn];
int mn[maxk];
int dp[maxn][maxk];
stack<pii> stk[maxk];
int main(void)
{
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= k; i++)
mn[i] = inf;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= min(k, i); j++)
{
while (stk[j].size() && stk[j].top().ff <= a[i])
{
mn[j] = min(mn[j], dp[stk[j].top().ss][j-1]);
stk[j].pop();
}
stk[j].push({a[i], i});
mn[j] = min(mn[j], dp[i-1][j-1]);
if (a[i] <= a[i-1]) dp[i][j] = min(a[i]+mn[j], dp[i-1][j]);
else dp[i][j] = a[i]+mn[j];
}
}
printf("%d\n", dp[n][k]);
}
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... |