# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
595443 | Belphegor | Stove (JOI18_stove) | C++14 | 112 ms | 98508 KiB |
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;
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 time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |