题目链接:http://poj.org/problem?id=1185
题意:在n×m的地图上放置炮兵,每个炮兵的攻击范围是上下左右各延伸两格,地图上有一些位置为山地,不可以放置,问给出地图可以放置炮兵的最多数量。
思路:状态压缩DP,如果当前第i行放置,由于考虑到炮兵的攻击范围,所以需要枚举前两行的状态,所以用dp[i][s1][s2]来表示第i行状态为s1,上一行状态为s2的最多炮兵放置数量。由于每一行地形不一定相同,所以先把每一行可行的状态先预处理出来。然后再Dp。
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;
#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)
#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff
#define mod %100000007
int n,m;
int a[109][12];
vector<int> state[109];
int now[109]; //每一行地图的状态
map<int,int> num; //存每个状态的人数
int dp[109][65][65];
void init()
{
num.clear();
int tot = 0;
rep(i,0,1<<10)
{
if ( i & (i<<2) || i & (i<<1) ) continue;
int x = 0;
rep(j,0,9) if ( i & (1<<j) ) x++;
num[i] = x;
tot++;
}
//cout<<tot<<endl; //计算状态最大数量
scanf("%d%d",&n,&m);
rep(i,1,n)
{
char c;
getchar();
now[i] = 0;
rep(j,1,m)
{
c = getchar();
if ( c == 'P' ) a[i][j] = 0;
else a[i][j] = 1;
now[i] = now[i] * 2 + a[i][j];
}
}
int uplim = 1<<m;
state[0].clear();
state[0].push_back(0);//第0行的可行状态为0
rep(i,1,n) //预处理每一行的可行状态
{
state[i].clear();
rep(j,0,uplim - 1)
{
if ( j & (j<<1) || j & (j<<2) || j & now[i] ) continue;
state[i].push_back(j);
}
}
}
void Dp()
{
Clean(dp,0);
rep(i,0,state[1].size()-1) dp[1][i][0] = num[state[1][i]];
rep( i , 2 , n)
rep( j , 0 , state[i].size() - 1 )
rep( k , 0 , state[i-1].size() - 1 )
{
if ( state[i][j] & state[i-1][k] ) continue;
rep( l , 0 , state[i-2].size() - 1 )
if ( state[i][j] & state[i-2][l] || state[i-1][k] & state[i-2][l] ) continue;
else dp[i][j][k] = max( dp[i][j][k] , dp[i-1][k][l] + num[ state[i][j] ] );
}
int ans = 0;
rep(i,0,state[n].size()-1)
rep(j,0,state[n-1].size()-1)
ans = max( ans , dp[n][i][j] );
cout<<ans<<endl;
}
int main()
{
init();
Dp();
return 0;
}