# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102774 | Mahmoud_Adel | K blocks (IZhO14_blocks) | C++14 | 0 ms | 0 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;
#define s second
#define f first
typedef long long ll;
const int N = 100005, M = 105;
int n, k, a[N], dp[M][N], ch[M][N];
int main()
{
cin >> n >> k;
for(int i=1; i<=n; i++) cin >> a[i];
memset(dp, 0x3f3f3f3f, dp);
dp[0][0] = 0;
for(int i=1; i<=k; i++)
{
stack<int> s;
for(int j=i; j<=n; j++)
{
dp[i][j] = dp[i-1][j-1]+ a[j], ch[i][j] = a[j];
while(!s.empty())
{
int u = s.top();
if(a[u] <= a[j])
{
if(dp[i][j] > dp[i][u] - ch[i][u] + max(ch[i][u], a[j]))
dp[i][j] = dp[i][u] - ch[i][u] + max(ch[i][u], a[j]), ch[i][j] = max(ch[i][u], a[j]);
}
else break;
s.pop();
}
if(!s.empty())
{
int u = s.top();
if(dp[i][u] < dp[i][j])
{
dp[i][j] = dp[i][u];
ch[i][j] = ch[i][u];
}
}
s.push(j);
}
}
cout << dp[k][n] << endl;
}