问题描述:
1. 一个球场C的球迷看台可容纳M*N个球迷。官方想统计一共有多少球迷群体,最大的球迷群体有多少人。
球迷选座特性:1.
1.同球迷群体会选择相邻座位,不同球迷群体选择不相邻的座位。(相邻包括前后相邻、左右相邻、斜对角相邻);
2.给定一个M*N的二位球场,0代表该位置没人,1代表该位置有人,希望输出球队群体个数P,最大的球队群体人数Q。
输入:
第一行,2个数字,M N,使用英文逗号隔开
接下来M行,每行N个数字,使用英文逗号隔开
输出:
一行 ,2数字,P Q
例子:
输入:
10,10
0,0,0,0,0,0,0,0,0,0
0,0,0,1,1,0,1,0,0,0
0,1,0,0,0,0,0,1,0,1
1,0,0,0,0,0,0,0,1,1
0,0,0,1,1,1,0,0,0,1
0,0,0,0,0,0,1,0,1,1
0,1,1,0,0,0,0,0,0,0
0,0,0,1,0,1,0,0,0,0
0,0,1,0,0,1,0,0,0,0
0,1,0,0,0,0,0,0,0,0
输出:6,8
解析:递归的思想对于1的周围进行遍历
#include<iostream>
#include<string>
#include<vector>
using namespace std;
void dfs(int ** fans, int a, int b,int row,int column,int& num)
{
if (a < 0 || a >= row || b < 0 || b >= column)
return;
if (!fans[a][b])
return;
fans[a][b] = 0;//为1的点变为0,表示遍历过了
num++;//球队人数+1;
dfs(fans, a - 1, b - 1, row, column, num);
dfs(fans, a - 1, b , row, column, num);
dfs(fans, a - 1, b +1, row, column, num);
dfs(fans, a , b - 1, row, column, num);
//dfs(fans, a , b , row, column, num);
dfs(fans, a , b +1, row, column, num);
dfs(fans, a + 1, b - 1, row, column, num);
dfs(fans, a + 1, b , row, column, num);
dfs(fans, a +1, b + 1, row, column, num);
return;
}
int main()
{
int m, n;
char a;
cin >> m >>a>> n;
int **position = new int*[m];
for (int i = 0; i < m; i++)
position[i] = new int[n];
int p;
for (int i = 0; i < m; i++){
for (int j = 0; j < n;){
cin >> p;
cin.ignore(1, ',');
position[i][j] = p;
j++;
}
}
int team = 0;
int max_num = 0;
for (int i = 0; i < m; i++){
for (int j = 0; j < n; j++){
if (position[i][j]){
team++;
int num = 0;
dfs(position, i, j, m, n, num);
if (num > max_num)
max_num = num;
}
}
}
cout <<team<<","<< max_num << endl;
system("pause");
return 0;
}