方格取数(1)

3
75 15 21 
75 15 28 
34 70 5 

188

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <iomanip>
#define INF 99999999
typedef long long LL;
using namespace std;

const int MAX=17711+10;
int n,nowsize,lastsize;
int now[MAX],last[MAX];
int dp[MAX],temp[MAX],ans[MAX];
int w[22][22];

void dfs(int id,int k,int p,int sum){
	if(k>=n){now[++nowsize]=p;ans[nowsize]=sum;return;}
	dfs(id,k+2,p|(1<<k),sum+w[id][k]);
	dfs(id,k+1,p,sum);
}

void DP(){
	for(int k=1;k<=n;++k){
		nowsize=0;
		dfs(k,0,0,0);
		for(int i=1;i<=nowsize;++i)dp[i]=0;
		for(int i=1;i<=nowsize;++i){
			for(int j=1;j<=lastsize;++j){
				if(now[i] & last[j])continue;
				dp[i]=max(dp[i],temp[j]+ans[i]);
			}
		}
		for(int i=1;i<=nowsize;++i)temp[i]=dp[i];
		for(int i=1;i<=nowsize;++i)last[i]=now[i];
		lastsize=nowsize;
	}
}

int main(){
	while(~scanf("%d",&n)){
		for(int i=1;i<=n;++i){
			for(int j=0;j<n;++j)scanf("%d",&w[i][j]);
		}
		temp[1]=last[1]=0;
		lastsize=1;
		DP();
		int sum=0;
		for(int i=1;i<=lastsize;++i)sum=max(sum,temp[i]);
		printf("%d\n",sum);
	}
	return 0;
}

hdu1565之状态压缩dp,布布扣,bubuko.com

hdu1565之状态压缩dp

原文：http://blog.csdn.net/xingyeyongheng/article/details/21551769