1839406_ac_0ms_44k.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>
int m, n, NO, MAX, tmp, inf[51][51], mark[51][51];
void find(int x, int y)
{
 mark[x][y] = 1;tmp++;
 if(!(inf[x][y]&1)&&!mark[x][y-1]) {mark[x][y-1] = 1;find(x,y-1);}
 if(!(inf[x][y]&2)&&!mark[x-1][y]) {mark[x-1][y] = 1;find(x-1,y);}
 if(!(inf[x][y]&4)&&!mark[x][y+1]) {mark[x][y+1] = 1;find(x,y+1);}
 if(!(inf[x][y]&8)&&!mark[x+1][y]) {mark[x+1][y] = 1;find(x+1,y);}
}
void scan()
{
 int i, j;
 for(i = 0; i < m; i++)
  for(j = 0; j < n; j++)
   {
     if(!mark[i][j])
     {
      tmp = 0;find(i,j);NO++;
     }
     if(tmp > MAX) MAX = tmp;
   } 
}
void main()
{
 int i, j;
 MAX = 0;
 scanf("%d%d",&m,&n);
 for(i = 0; i < m; i++)
  for(j = 0; j < n; j++)
    {
     scanf("%d",&inf[i][j]);
     mark[i][j] = 0;
    }
    scan();
 printf("%d\n%d\n",NO,MAX);   
}