二维数组寻找集聚地

#include<stdio.h>

int s[50][50] = { 0 };
int m_n[50][50] = { 0 };
int count;
void fun(int x, int y, int m, int n)
{
	if (s[x][y] == 1 || x<0 || x >= m || y<0 || y >= n || m_n[x][y] == 0)
	{
		return;
	}

	if (m_n[x][y] == 1 && s[x][y] == 0)
	{
		s[x][y] = 1;
	}
	fun(x + 1, y, m, n);
	fun(x - 1, y, m, n);
	fun(x, y + 1, m, n);
	fun(x, y - 1, m, n);
}
int main()
{
	int m, n;

	scanf("%d", &m);
	scanf("%d", &n);

	for (int i = 0; i<m; ++i)
	{
		for (int j = 0; j<n; j++)
		{
			scanf("%d", &m_n[i][j]);
		}
	}

	for (int i = 0; i<m; ++i)
	{
		for (int j = 0; j<n; j++)
		{
			if (s[i][j] == 0 && m_n[i][j] == 1)
			{
				fun(i, j, m, n);
				count++;
			}

		}
	}

	printf("%d\n", count);
	return 0;
}