POJ-1481

#include <stdio.h>

char grid[50][50];
int visited[50][50];
int sum[1250], top;
int rows, columns;

void dfsX(int x, int y)
{
     // 设为访问过
     visited[x][y] = 2;
     if (x-1 >= 0 && visited[x-1][y] != 2 && grid[x-1][y] == 'X')
        dfsX(x-1, y);
     if (y+1 < 50 && visited[x][y+1] != 2 && grid[x][y+1] == 'X')
        dfsX(x, y+1);
     if (x+1 < 50 && visited[x+1][y] != 2 && grid[x+1][y] == 'X')
        dfsX(x+1, y);
     if (y-1 >= 0 && visited[x][y-1] != 2 && grid[x][y-1] == 'X')
        dfsX(x, y-1);
}

void dfs(int x, int y)
{
     // 如果是点
     if (grid[x][y] == 'X' && visited[x][y] != 2) {
        sum[top]++;
		dfsX(x, y);
	 }
	 // 设为访问过
     visited[x][y] = 1;
     if (x-1 >= 0 && visited[x-1][y] != 1 && grid[x-1][y] != '.')
        dfs(x-1, y);
     if (y+1 < columns && visited[x][y+1] != 1 && grid[x][y+1] != '.')
        dfs(x, y+1);
     if (x+1 < rows && visited[x+1][y] != 1 && grid[x+1][y] != '.')
        dfs(x+1, y);
     if (y-1 >= 0 && visited[x][y-1] != 1 && grid[x][y-1] != '.')
        dfs(x, y-1);
}

int intcmp(const void *a,const void *b )
{
	return *(int *)a - *(int *)b;
}

int main()
{
    int i, j, tests = 0;
    while (scanf("%d%d\n", &columns, &rows), rows, columns) {         
          for (i = 0; i < rows; i++) {
              gets(grid[i]);
              for (j = 0; j < columns; j++)
                  visited[i][j] = 0;
          }
          printf("Throw %d\n", ++tests);
		  top = 0;
          for (i = 0; i < rows; i++)
              for (j = 0; j < columns; j++){
                  if (visited[i][j] != 1 && grid[i][j] != '.') {
					 sum[top] = 0;
                     dfs(i, j);
					 if (sum[top])
						 top++;
                  }
              }
		  qsort(sum, top, sizeof(int), intcmp); 
		  for (i = 0, top--; i < top; i++)
			  printf("%d ", sum[i]);
          printf("%d\n\n", sum[top]);
    }
    return 0;
}