[POJ1185] [NOI2001] 炮兵阵地

难难难 居然每行只有几十个合法状态

预处理状态 编号就开的下数组了 

然后转移方程不难 就这样吧

状压DP好难啊= = 

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int MAXN = 100;
const int MAXM = 10;
const int MAXS = 70;
const int maxs = (1 << MAXM);
int d[MAXN+10][MAXS+10][MAXS+10];
int n, m, Map[MAXN+10], S;
int ID[maxs+10], idcnt, cnt[maxs+10];
char A[MAXN+10];
bool ok(int x)
{
	if(x & (x << 1)) return false;
	if(x & (x << 2)) return false;
	return true;
}
int calculate(int x)
{
	int sum = 0;
	for(int i = 0; i < m; i++) 
		if(x & (1 << i)) 
			sum++;
	return sum;
}
int main()
{
	memset(d, -1, sizeof(d));
	scanf("%d%d", &n, &m);
	S = 1 << m;
	for(int i = 0; i < n; i++)
	{
		scanf("%s", A);
		for(int j = 0; j < m; j++)
			if(A[j] == 'H')
				Map[i] |= (1 << j);
	}
	for(int i = 0; i < S; i++)
		if(ok(i))
		{
			ID[idcnt] = i;
			cnt[idcnt++] = calculate(i);
		}
	for(int i = 0; i < idcnt; i++)
		if(!(ID[i] & Map[0]))
			d[0][i][0] = cnt[i];
	for(int row = 1; row < n; row++)
	{
		for(int i = 0; i < idcnt; i++)
		{
			if(ID[i] & Map[row]) continue;
			for(int j = 0; j < idcnt; j++)
			{
				if(ID[j] & ID[i]) continue;
				if(ID[j] & Map[row-1]) continue;
				for(int k = 0; k < idcnt; k++)
				{
					if(ID[k] & ID[j]) continue;
					if(ID[k] & ID[i]) continue;
					if(ID[k] & Map[row-2]) continue;
					if(d[row-1][j][k] == -1) continue;
					d[row][i][j] = max(d[row-1][j][k] + cnt[i], d[row][i][j]);
				}
			}
		}
	}
	int ans = 0;
	for(int i = 0; i < idcnt; i++)
		for(int j = 0; j < idcnt; j++)
			ans = max(ans, d[n-1][i][j]);
	printf("%d", ans);
}