제출 #487240

#제출 시각아이디문제언어결과실행 시간메모리
487240ala2Stove (JOI18_stove)C++14
20 / 100
7 ms8524 KiB
#include <bits/stdc++.h>

using namespace std;
int dp[1010][1010];
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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...