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 dp[5010][5010];
int t[1001000];
int f(int i,int k)
{
//cout<<" "<<i<<" "<<k<<endl;
if(dp[i][k]!=-1)
return dp[i][k];
if(k<=0)
return 1000000000;
if(i==0)
return 1;
return dp[i][k]=min(f(i-1,k-1)+1,f(i-1,k)+t[i]+1-t[i-1]);
}
int main()
{
int n,k;
cin>>n>>k;
memset(dp,-1,sizeof dp);
for(int i=0;i<n;i++)
cin>>t[i];
cout<<f(n-1,k)-n+k;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |