POJ 1185 java实现
import java.util.Scanner;
public class Main1185 {
static boolean unlegal(int a, int b) {//判断两个状态共存时是否不合法,合法为false,不合法为true
if ((a & b) == 0) {
return false;
} else {
return true;
}
}
static int max(int a, int b) {//返回较大值
return a > b ? a : b;
}
public static void main(String[] args) throws Exception {
System.setIn(new java.io.FileInputStream("1185.txt"));
Scanner sc = new Scanner(System.in);
int n, m;
while (sc.hasNext()) {
n = sc.nextInt();
m = sc.nextInt();
int paoStatus[] = new int[61];
int base[] = new int[100];
int soldier[] = new int[61];
for (int i = 0; i < n; i++) {//先计算原始地图base[i]的状态数,高地为1,平原为0
char[] as = sc.next().toCharArray();
for (int j = 0; j < m; j++) {
base[i] <<= 1;
if (as[j] == 'H') {
base[i] += 1;
}
}
}
// for (int i = 0; i < base.length; i++) {
// String tem=Integer.toBinaryString(base[i]);
// System.out.println(tem);
// }
int tep = 1;
tep <<= m;
int num = 0;
for (int i = 0; i < tep; i++) {//两两炮兵不互相攻击的条件下,计算所有状态
int t1 = i;
int t2 = i;
t1 <<= 1;
t2 <<= 2;
if (unlegal(i, t2) || unlegal(i, t1)) {
continue; //i这个状态出现了士兵两两攻击
}
paoStatus[num] = i;//保存这个合法的状态
int paonumLine = i;
while (paonumLine > 0) {//这个循环计算状态i的二进制形式里面有多少个1,也就是放了多少个士兵
soldier[num] += paonumLine & 1;
paonumLine >>= 1;
}
num++;
}
int dp[][][] = new int[100][num][num];
for (int i = 0; i < num; i++) {
//先初始化dp[0][i][0],即初始化第1行的情况
if (unlegal(paoStatus[i], base[0])){continue;}
//在paoStatus[i]的基础上,还要满足士兵不能放在山上,这个判断就是处理这个问题的
dp[0][i][0] = soldier[i];
}
for (int i = 0; i < num; i++) {
//接着初始化dp[1][i][j],即第2行的情况
if (unlegal(paoStatus[i], base[1])) {continue;}
for (int j = 0; j < num; j++) {
//枚举第1行的状态
if (unlegal(paoStatus[j], base[0])) {continue;}
if (unlegal(paoStatus[i], paoStatus[j])){continue;}
dp[1][i][j] = max(dp[1][i][j], dp[0][j][0] + soldier[i]);
}
}
for (int r = 2; r < n; r++) {
//第3行开始DP直到最后
for (int i = 0; i < num; i++) {
//枚举第r行的状态
if (unlegal(paoStatus[i], base[r])) {continue;}
for (int j = 0; j