-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbombDFS.c
More file actions
101 lines (80 loc) · 1.7 KB
/
Copy pathbombDFS.c
File metadata and controls
101 lines (80 loc) · 1.7 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
#include <stdio.h>
char a[20][21];
int book[20][20], max, mx, my, n, m;
int getnum(int i, int j)
{
int sum, x, y;
sum = 0;
x=i; y=j;
while(a[x][y] != '#')
{
if(a[x][y] == 'G')
sum++;
x--;
}
x=i; y=j;
while(a[x][y] != '#')
{
if(a[x][y] == 'G')
sum++;
x++;
}
x=i; y=j;
while(a[x][y] != '#')
{
if(a[x][y] == 'G')
sum++;
y--;
}
x=i; y=j;
while(a[x][y] != '#')
{
if(a[x][y] == 'G')
sum++;
y++;
}
return sum;
}
void dfs(int x, int y)
{
int next[4][2]={{1,0},{0,-1},{-1,0},{0,1}};
int k,sum,tx,ty;
//对每个开始的节点进行判断
sum = getnum(x,y);
if(sum>max)
{
max = sum;
mx = x;
my = y;
}
for(k=0; k<4; k++)
{
tx = x + next[k][0];
ty = y + next[k][1];
if(tx<0 || tx>n-1 || ty<0 || ty>m-1)
continue;
if(book[tx][ty] == 0 && a[tx][ty] == '.')
{
book[tx][ty] = 1;
dfs(tx, ty);
// 这个题目只是为了标记，因此不需要回溯过程了
// book[i][j] = 0;
}
}
return;
}
int main()
{
int i,startx,starty;
scanf("%d %d %d %d", &n, &m, &startx, &starty);
for(i=0; i<=n-1; i++)
scanf("%s", a[i]);
book[startx][starty] = 1;
max = getnum(startx, starty);
mx = startx;
my = starty;
dfs(startx,starty);
printf("Place the bomb in (%d,%d), down %d monsters\n", mx, my, max);
getchar();getchar();
return 0;
}