#include<iostream>
using namespace std;
struct note
{
int x;
int y;
};
int main()
{
struct note que[2501];
int a[51][51];
int head, tail;
int book[51][51] = { 0 };
int sum, max = 0, mx, my, n, m, startx, starty, tx, ty;
int next[4][2] = { {0,1},{1,0},{0,-1},{-1,0} };
scanf("%d %d %d %d", &n, &m, &startx, &starty);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
scanf("%d", &a[i][j]);
head = 1;
tail = 1;
que[tail].x = startx;
que[tail].y = starty;
tail++;
book[startx][starty] = 1;
sum = 1;
while (head < tail)
{
for (int i = 0; i < 4; ++i)
{
tx = que[head].x + next[i][0];
ty = que[head].y + next[i][1];
if (tx<1 || tx>n || ty<1 || ty>m)
continue;
if (a[tx][ty] > 0 && book[tx][ty] == 0)
{
sum++;
book[tx][ty] = 1;
que[tail].x = tx;
que[tail].y = ty;
tail++;
}
}
head++;
}
printf("%d\n", sum);
system("pause");
return 0;}
Aha算法学习——Ch4-5寻宝
最新推荐文章于 2024-07-08 15:44:52 发布