POJ 1185 炮兵陣地

gaiStateDp[i][j][k] = max{gaiStateDp[i-1][k][p]+c[j]},(枚舉p的每種狀態) 
gaiStateDp[i][j][k]表示第i行狀態爲aiState[j],第i-1行狀態爲aiState[k]的最大炮兵數,且aiState[j],aiState[k],aiState[p]及地形之間互不衝突.

 

/*炮兵陣地 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 8514 Accepted: 2986 Description 司令部的將軍們打算在N*M的網格地圖上部署他們的炮兵部隊。一個N*M的地圖由N行M列組成，地圖的每一格可能是山地（用"H" 表示），也可能是平原（用"P"表示），如下圖。在每一格平原地形上最多可以佈置一支炮兵部隊（山地上不能夠部署炮兵部隊）；一支炮兵部隊在地圖上的攻擊範圍如圖中黑色區域所示： 如果在地圖中的灰色所標識的平原上部署一支炮兵部隊，則圖中的黑色的網格表示它能夠攻擊到的區域：沿橫向左右各兩格，沿縱向上下各兩格。圖上其它白色網格均攻擊不到。從圖上可見炮兵的攻擊範圍不受地形的影響。 現在，將軍們規劃如何部署炮兵部隊，在防止誤傷的前提下（保證任何兩支炮兵部隊之間不能互相攻擊，即任何一支炮兵部隊都不在其他支炮兵部隊的攻擊範圍內），在整個地圖區域內最多能夠擺放多少我軍的炮兵部隊。 Input 第一行包含兩個由空格分割開的正整數，分別表示N和M； 接下來的N行，每一行含有連續的M個字符('P'或者'H')，中間沒有空格。按順序表示地圖中每一行的數據。N <= 100；M <= 10。 Output 僅一行，包含一個整數K，表示最多能擺放的炮兵部隊的數量。 Sample Input 5 4 PHPP PPHH PPPP PHPP PHHP Sample Output 6 */ #include <stdio.h> #include "string.h" #define MAX_ROW_NUM 100 #define MAX_STATE_NUM 60 #define MAX(a,b) (((a) > (b)) ? (a) : (b)) typedef struct _POSSIBLE_STATE_ST_ { int iStateNum; int aiState[MAX_STATE_NUM]; int aiState1Num[MAX_STATE_NUM];/*1的個數*/ }POSSIBLE_STATE_ST; int gaiMap[MAX_ROW_NUM]; int gaiStateDp[MAX_ROW_NUM][MAX_STATE_NUM][MAX_STATE_NUM]; POSSIBLE_STATE_ST gstPossibleState; int ArtilleryPositionmain(void) { char acInputBuff[11]; int iM; int iN; int iInvalidState; int iLoopM; int iLoopN; int iStateNum; int iLoop; int iLoopState; int iLoopPreLineState; int iLoopPrePreLineState; int iResult = 0; int iMaxPreNum; int iTempState; memset(gaiMap,0,MAX_ROW_NUM*sizeof(int)); memset(gaiStateDp,0,MAX_STATE_NUM*MAX_ROW_NUM*sizeof(int)); /*input*/ scanf("%d %d",&iN,&iM); for (iLoopN = 0; iLoopN < iN; iLoopN++) { scanf("%s",acInputBuff); for (iLoopM = 0; iLoopM < iM; iLoopM++) { gaiMap[iLoopN] = gaiMap[iLoopN]<<1; gaiMap[iLoopN] |= ('H' == acInputBuff[iLoopM]); } } iStateNum = (1<<iM); /*init possible state*/ gstPossibleState.iStateNum = 0; for (iLoopState = 0; iLoopState < iStateNum; iLoopState++) { iInvalidState = 3;//11B for (iLoop = 0; iLoop < iM-1; iLoop++) { if(iInvalidState == (iInvalidState&iLoopState)) { break; } iInvalidState = iInvalidState<<1; } if (iLoop < iM-1) { continue; } iInvalidState = 5;//101B for (iLoop = 0; iLoop < iM-2; iLoop++) { if(iInvalidState == (iInvalidState&iLoopState)) { break; } iInvalidState = iInvalidState<<1; } if (iLoop < iM-2) { continue; } iTempState = iLoopState; gstPossibleState.aiState1Num[gstPossibleState.iStateNum] = 0; while(iTempState) { iTempState &= (iTempState-1); gstPossibleState.aiState1Num[gstPossibleState.iStateNum]++; } gstPossibleState.aiState[gstPossibleState.iStateNum] = iLoopState; gstPossibleState.iStateNum++; } /*resolve*/ for (iLoopN = 0; iLoopN < iN; iLoopN++) { for (iLoopState = 0; iLoopState < gstPossibleState.iStateNum; iLoopState++) { /*hill*/ if (0 != (gaiMap[iLoopN]&gstPossibleState.aiState[iLoopState])) { continue; } if (0 == iLoopN) { gaiStateDp[0][iLoopState][0] = gstPossibleState.aiState1Num[iLoopState]; } else if (1 == iLoopN) { for (iLoopPreLineState = 0; iLoopPreLineState < gstPossibleState.iStateNum; iLoopPreLineState++) { /*hill*/ if (0 != (gaiMap[0]&gstPossibleState.aiState[iLoopPreLineState])) { continue; } if (0 <= gaiStateDp[0][iLoopPreLineState][0] &&0 == (gstPossibleState.aiState[iLoopPreLineState]&gstPossibleState.aiState[iLoopState])) { gaiStateDp[iLoopN][iLoopState][iLoopPreLineState] = gstPossibleState.aiState1Num[iLoopState]+gaiStateDp[0][iLoopPreLineState][0]; } } } else { for (iLoopPreLineState = 0; iLoopPreLineState < gstPossibleState.iStateNum; iLoopPreLineState++) { /*hill*/ if (0 != (gaiMap[iLoopN-1]&gstPossibleState.aiState[iLoopPreLineState])) { continue; } iMaxPreNum = 0; for (iLoopPrePreLineState = 0; iLoopPrePreLineState < gstPossibleState.iStateNum; iLoopPrePreLineState++) { /*hill*/ if (0 != (gaiMap[iLoopN-2]&gstPossibleState.aiState[iLoopPrePreLineState])) { continue; } if (0 == (gstPossibleState.aiState[iLoopPreLineState]&gstPossibleState.aiState[iLoopState]) &&0 == (gstPossibleState.aiState[iLoopPrePreLineState]&gstPossibleState.aiState[iLoopState]) &&0 == (gstPossibleState.aiState[iLoopPrePreLineState]&gstPossibleState.aiState[iLoopPreLineState])) { iMaxPreNum = MAX(iMaxPreNum,gaiStateDp[iLoopN-1][iLoopPreLineState][iLoopPrePreLineState]); } } gaiStateDp[iLoopN][iLoopState][iLoopPreLineState] = gstPossibleState.aiState1Num[iLoopState]+iMaxPreNum; } } } } for (iLoopState = 0; iLoopState < gstPossibleState.iStateNum; iLoopState++) { for (iLoop = 0; iLoop < gstPossibleState.iStateNum; iLoop++) { iResult = MAX(iResult,gaiStateDp[iN-1][iLoopState][iLoop]); } } printf("%d/n",iResult); return 0; }