思路:状态压缩dp,设dp[i][j] 表示前i行,状态为j时的最大值,状态定义为:若前i行中取了第x列那么j的二进制位中第x位为1,否则为0,最后答案就是dp[n-1][(1 << n)-1];
装态转移方程就是 dp[i][j|(1 << k)] = max(dp[i][j|(1 << k)],dp[i-1][j] + mat[i][k]) (j & (1 << k) == 0)
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN = 16;
int dp[MAXN][1 << MAXN], mat[MAXN][MAXN];
int main(){
int t, n, CASE(0);
scanf("%d", &t);
while(t--){
scanf("%d", &n);
for(int i = 0;i < n;i ++){
for(int j = 0;j < n;j ++) scanf("%d", &mat[i][j]);
}
int len = (1 << n);
memset(dp, 0, sizeof dp);
for(int i = 0;i < n; i ++) dp[0][1 << i] = mat[0][i];
for(int i = 1;i < n;i ++){
for(int j = 0;j < n;j ++){
for(int k = 0;k < len;k ++){
if(!dp[i-1][k] || (1 << j) & k) continue;
dp[i][k|(1 << j)] = max(dp[i][k|(1 << j)], dp[i-1][k]+mat[i][j]);
}
}
}
printf("Case %d: %d\n", ++CASE, dp[n-1][len-1]);
}
return 0;
}
;