poj 1185 炮兵阵地

    经典状态压缩dp，明显是压缩列，但是需要考虑前两行所有职能开3维矩阵了，可以先把满足的情况存入vector中，这样可以减少枚举状态。。。。

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

#define LL long long
#define CLR(a, b) memset(a, b, sizeof(a))
#define SL(a) strlen(a)
#define PB(a) push_back(a)

using namespace std;

const int N = 111;
const int M = 13;

int dp[N][N][N];
char map[N][N];
vector<int> vc[N], num[N];

int ok(int k, int t)
{
    int i = -3,j = 0, cnt = 0;
    while(k)
    {
        if(k & 1)
        {
            if(map[t][j] == 'H') return 0;
            else
            {
                if(j - i <= 2) return 0;
                else i = j;
            }
            cnt ++;
        }
        k >>= 1;
        j ++;
    }
    return cnt;
}


int main()
{
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int n, m, i, j, ans, k, s;
    while(cin >> n >> m)
    {
        CLR(dp, 0);
        for(i = 0; i < n; i ++)
        {
            vc[i].clear();
            num[i].clear();
            cin >> map[i];
        }
        for(j = 0; j < n; j ++)
        {
            vc[j].PB(0), num[j].PB(0);
            for(i = 1; i < (1 << m); i ++)
            {
                k = ok(i, j);
                if(k) vc[j].PB(i), num[j].PB(k);
            }
        }
        ans = 0;
        for(i = 0; i < vc[0].size(); i ++)
        {
            dp[0][i][0] = num[0][i];
            ans = max(ans, num[0][i]);
        }
        for(i = 0; i < vc[1].size(); i ++)
        {
            for(j = 0; j < vc[0].size(); j ++)
            {
                if((vc[1][i] & vc[0][j]) == 0)
                {
                    dp[1][i][j] = max(dp[1][i][j], num[1][i] + num[0][j]);
                }
            }
        }
        for(i = 2; i < n; i ++)
        {
            for(j = 0; j < vc[i].size(); j ++)
            {
                for(k = 0; k < vc[i - 1].size(); k ++)
                {
                    if((vc[i][j] & vc[i - 1][k]) == 0) for(s = 0; s < vc[i - 2].size(); s ++)
                    {
                        if(((vc[i][j] | vc[i - 1][k]) & vc[i - 2][s]) == 0)
                        {
                            dp[i][j][k] = max(dp[i][j][k], num[i][j] + dp[i - 1][k][s]);
                        }
                    }
                }
            }
        }
        for(i = 0; i < vc[n - 1].size(); i ++)
        {
            for(j = 0; j < vc[n - 2].size(); j ++)
                ans = max(ans, dp[n - 1][i][j]);
        }
        cout << ans << endl;
    }
}