poj 1164 The Castle dp区域计数水题
2015-01-23 00:00
417 查看
水题,直接贴代码。
//poj 1164 //sep9 #include <iostream> using namespace std; int a[64][64]; int dp[64][64]; int n,m; const int west=1,north=2,east=4,south=8; void dfs(int x,int y) { dp[x][y]=1; if((a[x][y]&north)==0&&dp[x-1][y]==-1){ dfs(x-1,y); dp[x][y]+=dp[x-1][y]; } if((a[x][y]&south)==0&&dp[x+1][y]==-1){ dfs(x+1,y); dp[x][y]+=dp[x+1][y]; } if((a[x][y]&west)==0&&dp[x][y-1]==-1){ dfs(x,y-1); dp[x][y]+=dp[x][y-1]; } if((a[x][y]&east)==0&&dp[x][y+1]==-1){ dfs(x,y+1); dp[x][y]+=dp[x][y+1]; } return ; } int main() { scanf("%d%d",&n,&m); int i,j; for(i=1;i<=n;++i) for(j=1;j<=m;++j) scanf("%d",&a[i][j]); memset(dp,-1,sizeof(dp)); int room_num=0,max_room=1; for(i=1;i<=n;++i) for(j=1;j<=m;++j) if(dp[i][j]==-1){ ++room_num; dfs(i,j); max_room=max(max_room,dp[i][j]); } printf("%d\n%d\n",room_num,max_room); return 0; }
相关文章推荐
- POJ 1164 The Castle
- The Castle POJ - 1164
- poj 1164:The Castle
- POJ 3186 Treats for the Cows (区间DP 水题)
- POJ 1298 The Hardest Problem Ever(我的水题之路——解密,水题)
- POJ 1595 Prime Cuts(我的水题之路——素数取中间区域,准确定位)
- poj 1887 Testing the CATCHER dp 最大降序
- POJ 2151 Check the difficulty of problems DP
- pku 1164 -- The Castle (递归)
- POJ_3017 Cut the Sequence 单调队列+dp+BST
- POJ 1207 The 3n+1 problem(我的水题之路——输入输出要保持原有顺序)
- poj1163 dp水题
- poj 2151 Check the difficulty of problems (DP)
- POJ 3311 Hie with the Pie【状态压缩DP】
- POJ 1989 The Cow Lineup [dp]
- POJ 2070 Filling Out the Team(我的水题之路——double比较)
- POJ 3311 Hie with the Pie //状态压缩DP
- zoj 1074 || poj 1050 To the Max(简单DP)
- POJ 1050 To the Max DP
- POJ 3100 Root of the Problem(我的水题之路——取A^N最接近B的A)