제출 #595443

#제출 시각아이디문제언어결과실행 시간메모리
595443BelphegorStove (JOI18_stove)C++14
50 / 100
112 ms98508 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; int T[5005]; int dp[5005][5005]; int f(int n,int k){ int&ret = dp[n][k]; if(~ret) return ret; ret = 1e9+1; if(!k) return ret; if(!n) return ret = 1; ret = min(ret,f(n-1,k-1)+1); ret = min(ret,f(n-1,k)+T[n]-T[n-1]); return ret; } int main(){ int n,k; cin>>n>>k; for(int i=0; i<n; i++) cin>>T[i]; memset(dp,-1,sizeof(dp)); cout<<f(n-1,k); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...