-
Notifications
You must be signed in to change notification settings - Fork 1
/
ConnectedCells.cpp
73 lines (53 loc) · 995 Bytes
/
ConnectedCells.cpp
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
// problem:"https://www.hackerrank.com/challenges/connected-cell-in-a-grid/problem"
#include<bits/stdc++.h>
using namespace std;
int n,m,Count;
void DFS (int a[][10],int i,int j)
{
if(a[i][j]==1)
{
a[i][j]=0;
Count++;
}
else
return;
if(j-1>=0)
DFS(a,i,j-1);
if(j-1>=0&&i+1<n)
DFS(a,i+1,j-1);
if(i+1<n)
DFS(a,i+1,j);
if(i+1<n&&j+1<m)
DFS(a,i+1,j+1);
if(j+1<m)
DFS(a,i,j+1);
if(j+1<m&&i-1>=0)
DFS(a,i-1,j+1);
if(i-1>=0)
DFS(a,i-1,j);
if(i-1>=0&&j-1>=0)
DFS(a,i-1,j-1);
return;
}
int main()
{
int a[10][10];
int i,j;
cin>>n>>m;
for(i=0;i!=n;i++)
for(j=0;j!=m;j++)
cin>>a[i][j];
int Max=0;
for(i=0;i!=n;i++)
{
for(j=0;j!=m;j++)
{
Count=0;
DFS(a,i,j);
if(Count>Max)
Max=Count;
}
}
cout<<Max;
return 0;
}