Submission #719765

#TimeUsernameProblemLanguageResultExecution timeMemory
719765josiftepeStove (JOI18_stove)C++14
20 / 100
1090 ms13580 KiB
#include <bits/stdc++.h>
 
using namespace std;
 
int n,k;
int dp[5005][5005];
int x[5005];
 
int f(int idx,int p)
{
    if(idx==n+1)return 0;
    if(p==0)return 1e9;
    if(dp[idx][p]!=2e9)
    {
        return dp[idx][p];
    }
    int rez=1e9;
    for(int 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(false);
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        cin>>x[i];
    }
    for(int i=0;i<=n;i++)
    {
        for(int j=0;j<=k;j++)
        {
            dp[i][j]=2e9;
        }
    }
    cout<<f(1,k)<<endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...