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;
long long n,k;
long long dp[5005][5005];
long long x[5005];
long long f(long long idx,long long p)
{
if(idx==n+1)return 0;
if(p==0)return 1e15;
if(dp[idx][p]!=1e15)
{
return dp[idx][p];
}
long long rez=1e15;
for(long long i=idx;i<=n;i++)
{
if(p-1>=0)
{
rez=min(rez, f(i+1,p-1)+x[i]-x[idx]+1);
}
}
return dp[idx][p]=rez;
}
int main()
{
ios_base::sync_with_stdio(true);
cin>>n>>k;
for(long long i=1;i<=n;i++)
{
cin>>x[i];
}
for(long long i=0;i<=n;i++)
{
for(long long j=0;j<=k;j++)
{
dp[i][j]=1e15;
}
}
cout<<f(1,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... |