[UVA1252] Twenty Questions && 状压DP

感觉状压DP都是无比的神啊 好难想啊= =  看了LRJ分析才搞出来的 

对于cnt的处理 假设某物体的特征为A 枚举到的状态为s 那么s & A这个已有特征集里面就有一个可行物体A 所以要++

开始(A[i][j] - '1') 打成了(A[i] - '1') 也不报个错 长教训了

#include<cstdio>
#include<ctime>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN = 128;
const int MAXS = 11;
const int maxs = (1 << MAXS);
int cnt[maxs+10][maxs+10], d[maxs+10][maxs+10], vis[maxs+10][maxs+10];
char A[MAXN+10][MAXS+10];
int n, m;
int dp(int s, int a)
{
	if(cnt[s][a] <= 1) return 0;
	if(cnt[s][a] == 2) return 1;
	int &ans = d[s][a];
	if(ans >= 0) return ans;
	
	ans = m;
	for(int i = 0; i < m; i++)
		if(!(s & (1 << i)))
		{
			int News = s | (1 << i), Newa = a | (1 << i), tmp;
			tmp = max(dp(News, a), dp(News, Newa))+1;
			ans = min(ans, tmp);
		}
	return ans;
}
int main()
{
	while(scanf("%d%d", &m, &n) == 2 && n)
	{
		for(int i = 0; i < n; i++) scanf("%s", A[i]);
		
		int Max = (1 << m);
		memset(cnt, 0, sizeof(cnt));
		for(int i = 0; i < n; i++)
		{
			int tmp = 0;
			for(int j = 0; j < m; j++) if(A[i][j] - '0') tmp |= (1 << j);
			for(int s = 0; s < Max; s++) cnt[s][s & tmp]++;
		}
		memset(d, -1, sizeof(d));
		printf("%d\n", dp(0, 0));
	}
}