POJ - 1185 炮兵阵地 状态压缩DP / 3状态

思路

代码

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <vector>

using namespace std;

const int N = 13, M = 1 << 10;

int g[110], f[2][M][M];
vector<int> state;
int n, m;
int cnt[M];

int count(int x)
{
	int ans = 0;
	for(int i = 0; i < m; i++)
		ans += x >> i & 1;
	
	return ans;
}

bool check(int x)
{
	for(int i = 0; i < m; i++)
		if(x >> i & 1)
		{
		    if(x >> i + 1 & 1)
		        return false;
		    if(x >> i + 2 & 1)
		        return false;
		}	
	return true;
}

int main()
{
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
		for(int j = 0; j < m; j++)
		{
			char c;
			cin >> c;
			if(c == 'H')
				g[i] += 1 << j;
		}
	
	for(int i = 0; i < 1 << m; i++)
		if(check(i))
			state.push_back(i), cnt[i] = count(i);
		
	for(int i = 1; i <= n + 2; i++)
		for(int j = 0; j < state.size(); j++)
			for(int k = 0; k < state.size(); k++)
				for(int l = 0; l < state.size(); l++)
				{
					int a = state[j];
					int b = state[k];
					int c = state[l];
					if(((a & b) == 0) && ((a & c) == 0) && ((c & b) == 0))
					{
					    if (g[i] & b | g[i - 1] & a) continue;
                        f[i & 1][j][k] = max(f[i & 1][j][k], f[i - 1 & 1][l][j] + cnt[b]);
					}  
				}
		
	cout << f[n + 2 & 1][0][0] << endl;
	return 0;
}