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

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int MAX_N = 110;
const int MAX_M = 15;
const int MAX_ST = 100;
int sc[MAX_ST],nsc;
int dp[MAX_N][MAX_N][MAX_ST];
int mp[MAX_N];
int bit[MAX_ST];
int n,m;
int Count_bit(int num)
{
int res=0;
while(num)
{
if(num&1)res++;
num>>=1;
}
return res;
}
void init_statu()
{
nsc=0;
int bound=1<<m;
for(int i=0;i<bound;i++)
{
if(i&(i<<1))continue;
if(i&(i<<2))continue;
sc[nsc]=i;
bit[nsc]=Count_bit(i);
nsc++;
}
}
void solve()
{
init_statu();
memset(dp,0,sizeof(dp));
for(int line=1;line<=n;line++)
{
for(int j=0;j<nsc;j++)
{
for(int k=0;k<nsc;k++)
{
if(sc[j]&sc[k])continue;
for(int i=0;i<nsc;i++)
{
if(sc[i]&sc[k])continue;
if(sc[i]&sc[j])continue;
if((sc[i]&mp[line])!=sc[i])continue;
dp[k][i][line]=max(dp[k][i][line],dp[j][k][line-1]+bit[i]);
}
}
}
}
int ans=0;
for(int i=0;i<nsc;i++)
{
for(int j=0;j<nsc;j++)
{

ans=max(ans,dp[i][j]
);
}
}
printf("%d\n",ans);
}

int main()
{

char cmd[MAX_M];
cin>>n>>m;
for(int i=1;i<=n;i++)
{
mp[i]=0;
scanf("%s",cmd);
for(int j=0;j<m;j++)
{
if(cmd[j]=='P')
{
mp[i]|=1<<j;
}
}
}
solve();
return 0;
}