hdu 1565 方格取数(1)

先预处理出所有满足状态的 i 并记录下来，即（i & ( i  << 1) ）！= 1，相邻两项不相等。然后 dp[i][j] = max(dp[i][j], dp[i-1][k] + sum); 其中这行与上行满足 sta[ k ] & sta [ j ] != 1；即与上行没有同一列全为1的情况。然后状压dp= =

#include<stdio.h>
#include<string.h>
#include<algorithm>

using namespace std;

int dp[21][1<<20];
int a[22][22];
int n;
int sta[20000];
int tot;

void init()
{
	tot = 0;
	for ( int i = 0; i < (1 << 20); i++ )
	{
		if( i & (i << 1) )
			continue;
		sta[tot++] = i;
	}
}

void solve()
{
	int sum;
	for ( int i = 1; i <= n; i++ )
	{
		for( int j = 0; j < tot && sta[j] < (1 << n); j++ )
		{
			int t = sta[j];
			sum = 0;
			int pos = 1;
			while(t)
			{
				if(t & 1)
					sum += a[i][pos];
				pos++;
				t >>= 1;
			}
			dp[i][j] = 0;
			for( int k = 0; k < tot && sta[k] < (1 << n); k++ )
			{
				if(sta[k] & sta[j])
					continue;
				dp[i][j] = max(dp[i][j], dp[i-1][k] + sum);
			}
		}
	}
}

int main()
{
	init();
	while(~scanf("%d", &n))
	{
		for(int i = 1; i <= n; i++)
		{
			for( int j = 1; j <= n; j ++ )
			{
				scanf("%d", &a[i][j]);
			}
		}
		solve();
		int ans = 0;
		for( int i = 0; i < tot && sta[i] < (1 << n); i ++)
		{
			ans = max(dp[n][i], ans);
		}
		printf("%d\n", ans);
	}
	return 0;
}

/*

*/

dp真的不会..