Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream fin("foto.in");
- ofstream fout("foto.out");
- int a[101][101] , n , m;
- int cnt = 0;
- const int di[]={0 , 0 , 1 , -1},
- dj[]={1 , -1 , 0 , 0};
- void Fill( int i , int j)
- {
- if( i >= 1 && i <=n && j >= 1 && j <=m && a[i][j]==0 )
- {
- a[i][j]= 2;
- cnt++;
- for( int k = 0 ; k < 4 ; k++)
- Fill(i + di[k] , j + dj[k]);
- }
- }
- int main()
- {
- fin >> n >> m;
- for( int i = 1; i <= n ; i++)
- for(int j = 1 ; j <= m ; j ++)
- fin >> a[i][j];
- int Max = 0;
- for( int i = 1; i <= n ; i++)
- for(int j = 1 ; j <= m ; j ++)
- if( a[i][j]== 0)
- {
- cnt = 0;
- Fill( i , j);
- if( cnt > Max)
- Max = cnt;
- }
- fout << Max;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement