Oil Deposits hdu1241 dfs

#include//2367513 2010-04-21 20:22:34 Accepted 1241 15MS 340K 992 B C++ 悔惜晟
using namespace std;
char map[105][105];
int dir[8][2] = { {0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1} };
int m, n; //一開始方向寫錯了，真是糾結的。

void dfs(int x, int y)
{
int i;
//if(x = m || y >= n)
//return ;
for(i = 0; i = m || y + dir[i][1] = n)
continue;
if(map[x + dir[i][0] ][y + dir[i][1] ] == '*' )
continue;
//if(map[x + dir[i][0] ][y + dir[i][1] ] == '@')
//{
map[x + dir[i][0] ][y + dir[i][1] ] = '*';
dfs(x + dir[i][0], y + dir[i][1] );
//}

}
}
int main()
{

int count;
while(cin>>m>>n)
{
if(m == 0)
break;
int i, j;
for(i = 0; i >map[i][j];
count = 0;
for(i = 0; i
using namespace std;
char map[105][105];
int dir[8][2] = { {0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1} };
int m, n;

void dfs(int x, int y)
{
int i;
if(x = m || y >= n)
return ;
for(i = 0; i = m || y + dir[i][1] = n)
//continue;
//if(map[x + dir[i][0] ][y + dir[i][1] ] == '*' )
//continue;
if(map[x + dir[i][0] ][y + dir[i][1] ] == '@')
{
map[x + dir[i][0] ][y + dir[i][1] ] = '*';
dfs(x + dir[i][0], y + dir[i][1] );
}

}
}
int main()
{

int count;
while(cin>>m>>n)
{
if(m == 0)
break;
int i, j;
for(i = 0; i >map[i][j];
count = 0;
for(i = 0; i

上一篇：Prime Ring Problem hdu 1016 dfs

下一篇：Rescue hdu 1242 很糾結？誰來幫我..