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 int long long
#define N 100006
int inf =10000000000006;
int dp[N][101];
int ind[N][101];
int32_t main()
{
int n, k;
cin>>n>>k;
vector < int > a(n+1);
for(int i=1;i<=n;i++)
cin>>a[i];
a[0] = inf;
for(int i=0;i<=n;i++)
{
for(int j=0;j<=k;j++)
{
dp[i][j] = inf;
ind[i][j] = 0;
}
}
dp[1][1] = a[1];
ind[1][1] = 1;
for(int i=2;i<=n;i++)
{
for(int j=1;j<=k;j++)
{
if( a[ind[i-1][j]] < a[i])
{
dp[i][j] = dp[i-1][j] + a[i] - a[ind[i-1][j]];
ind[i][j] = i;
}
else
{
dp[i][j] = dp[i-1][j];
ind[i][j] = ind[i-1][j];
}
if( dp[i-1][j-1] + a[i] < dp[i][j])
{
dp[i][j] = dp[i-1][j-1] + a[i];
ind[i][j] = i;
}
}
}
cout<<dp[n][k]<<endl;
return 0;
}
# | 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... |