Advertisement
Guest User

Untitled

a guest
Nov 20th, 2019
86
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.88 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3.  
  4. using namespace std;
  5.  
  6. ifstream fin("foto.in");
  7. ofstream fout("foto.out");
  8.  
  9. int a[101][101] , n , m;
  10. int cnt = 0;
  11.  
  12. const int di[]={0 , 0 , 1 , -1},
  13. dj[]={1 , -1 , 0 , 0};
  14.  
  15. void Fill( int i , int j)
  16. {
  17. if( i >= 1 && i <=n && j >= 1 && j <=m && a[i][j]==0 )
  18. {
  19. a[i][j]= 2;
  20. cnt++;
  21. for( int k = 0 ; k < 4 ; k++)
  22. Fill(i + di[k] , j + dj[k]);
  23. }
  24. }
  25.  
  26. int main()
  27. {
  28. fin >> n >> m;
  29. for( int i = 1; i <= n ; i++)
  30. for(int j = 1 ; j <= m ; j ++)
  31. fin >> a[i][j];
  32.  
  33. int Max = 0;
  34.  
  35. for( int i = 1; i <= n ; i++)
  36. for(int j = 1 ; j <= m ; j ++)
  37. if( a[i][j]== 0)
  38. {
  39. cnt = 0;
  40. Fill( i , j);
  41. if( cnt > Max)
  42. Max = cnt;
  43. }
  44. fout << Max;
  45.  
  46.  
  47. return 0;
  48. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement