题目
http://codeforces.com/contest/1437/problem/C
思路
d
p
[
i
]
[
j
]
dp[i][j]
dp[i][j]表示第
i
i
i分钟前拿了
j
j
j个盘子的最小代价
递推式:
d
p
[
i
]
[
j
]
=
m
i
n
(
d
p
[
i
−
1
]
[
j
]
,
d
p
[
i
−
1
]
[
j
−
1
]
+
a
b
s
(
a
[
j
]
−
i
)
)
dp[i][j]=min(dp[i-1][j],dp[i-1][j-1]+abs(a[j]-i))
dp[i][j]=min(dp[i−1][j],dp[i−1][j−1]+abs(a[j]−i))
代码
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int a[410];
int dp[410][410];
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
sort(a+1,a+1+n);
for(int i=0;i<=2*n;i++){
for(int j=0;j<=2*n;j++){
dp[i][j]=INF;
}
}
for(int i=0;i<=n*2;i++) dp[i][0]=0;
for(int i=1;i<=n*2;i++){
for(int j=0;j<=n;j++){
dp[i][j]=min(dp[i-1][j],dp[i-1][j-1]+abs(a[j]-i));
}
}
cout<<dp[2*n][n]<<endl;
}
return 0;
}