hdu 1312
2011-08-01 15:28
253 查看
恩,直接DFS,还好,不算很慢
#include<iostream> #include<string> #include<algorithm> using namespace std; char map[21][21]; int n,m,cnt; int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}}; void dfs(int si,int sj) { for(int k=0;k<4;k++) { int i=si+dir[k][0]; int j=sj+dir[k][1]; if(i>0&&i<=m&&j>0&&j<=n&&map[i][j]!='#') { map[i][j]='#'; cnt++; dfs(i,j); //cout<<i<<' '<<j<<endl; } } return ; } int main() { int s1,s2; while(cin>>n>>m&&(n||m)) { for(int i=1;i<=m;i++) { for(int j=1;j<=n;j++) { cin>>map[i][j]; if(map[i][j]=='@') {s1=i;s2=j;} } } map[s1][s2]='#'; cnt=1; dfs(s1,s2); cout<<cnt<<endl; } return 0; }
相关文章推荐
- day6 HDU 1312 Numerically Speaking
- Red and Black(hdu 1312)
- POJ 1979 && HDU 1312 Red and Black(DFS)
- hdu1312 Red and Black
- HDU 1312 Red and Black(简单广搜)
- hdu 1312 Red and Black
- HDU 1312 Red and Black (BFS)
- Red and Black HDU - 1312
- HDU-1312 Red and Black
- HDU 1312 Red and Black(水题)
- HDU-#1312 Red and Black(DFS)
- Hdu1312 - Red and Black - 广度优先搜索
- HDU 1312--Red and Black【DFS】
- HDU 1312 Red and Black
- HPU DFS + BFS 专项练习A - Red and Black HDU - 1312
- hdu 1312 Red and Black
- HDU 1312 Red and Black(DFS)
- Problem P:Red and Black(HDU 1312)
- hdu1312------------BFS(自己写队列)
- hdu 1312