1817:城堡问题
题目链接http://noi.openjudge.cn/ch0205/1817/
#include<iostream>
#include<algorithm>
using namespace std;
int a[55][55];
bool vis[55][55] = {
0 };
int maxx = 0,max_t;
int ans=0;
void dfs(int i, int j) {
vis[i][j] = 1;
max_t++;
if ((a[i][j] & 1)!=1) {
if (!vis[i][j - 1]) {
dfs(i, j - 1);
}
}
if ((a[i][j] & 2) != 2) {
if (!vis[i-1][j]) {
dfs(i-1, j );
}
}
if ((a[i][j] & 4) != 4) {
if (!vis[i][j + 1]) {
dfs(i, j + 1);
}
}
if ((a[i][j] & 8 )!= 8) {
if (!vis[i+1][j]) {
dfs(i+1, j);
}
}
}
int main() {
int r, c;
cin >> r >> c;
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
cin >> a[i][j];
}
}
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
if (!vis[i][j]) {
ans++;
max_t = 0;
dfs(i, j);
maxx = max(maxx, max_t);
}
}
}
cout << ans << endl << maxx;
return 0;
}