#include<bits/stdc++.h>
using namespace std;
const int MAXN = 5e3;
const long long INF = 1e15;
int n, k;
int a[MAXN+1];
long long dp[MAXN+1][MAXN+1][2];
long long f(int idx, int cnt, int state){
if(cnt > k) return INF;
if(idx == n){
if(state == 1) return 0;
else{
if(cnt < k) return 1;
return INF;
}
}
long long &ret = dp[idx][cnt][state];
if(ret != -1) return ret;
ret = INF;
if(state){
ret = min(ret, f(idx+1, cnt, 1) + (a[idx+1]-a[idx]));
ret = min(ret, f(idx+1, cnt, 0) + (a[idx+1]-a[idx]));
}
else{
ret = min(ret, f(idx+1, cnt+1, 1) + 1);
ret = min(ret, f(idx+1, cnt+1, 0) + 1);
}
return ret;
}
int main(){
memset(dp, -1, sizeof(dp));
cin>>n>>k;
for(int i=1; i<=n; i++){
cin>>a[i];
}
cout<<f(0,0,0)<<endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
81 ms |
262144 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
81 ms |
262144 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
81 ms |
262144 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |