Satellite photographs——DFS

地址：http://acm.swust.edu.cn/problem/0001/

搜索

Farmer John purchased satellite photos of W x H pixels of his farm (1  <= W <= 80, 1 <= H <= 1000) and wishes to determine the  largest 'contiguous' (connected) pasture. Pastures are contiguous when  any pair of pixels in a pasture can be connected by traversing adjacent  vertical or horizontal pixels that are part of the pasture.  (It is easy  to create pastures with very strange shapes, even circles that surround  other circles.)

Each photo has been digitally enhanced to show pasture area as an  asterisk ('*') and non-pasture area as a period ('.').  Here is a 10 x 5  sample satellite photo:

..*.....**
.**..*****
.*...*....
..****.***
..****.***

This photo shows three contiguous pastures of 4, 16, and 6 pixels.  Help FJ find the largest contiguous pasture in each of his satellite  photos.

Description

* Line 1: Two space-separated integers: W and H
* Lines 2..H+1: Each line contains W "*" or "." characters  representing one raster line of a satellite photograph.

Input

* Line 1: The size of the largest contiguous field in the satellite  photo.

Output

10 5 ..*.....** .**..***** .*...*.... ..****.*** ..****.***

Sample Input

16

 题意分析：一个卫星图片上边有 ' * ' 和  .    两种符号，可以上下左右查找，查询由 ' * ' 组成的最大面积。

这个题就是从开始进行判断当有 '  *  ' 的时候就进行上下左右的查找，如果找到  ' * ' 就要把面积加一，并且把 ' * ' 改变成 '  . '    以免重复记录，当以坐标的四个方向都没有 ' * '  的时候返回到第一次找到 ' * ' 的坐标处，将此处的坐标进行后移继续查找。

#include<stdio.h>
int row,column;
char a[80][1000];
int area,ans;   定义整形的全局变量认为初始值都是0
#define max(a,b)  (a>b?a:b)
int dir[4][2]={1,0,-1,0,0,1,0,-1};
void dfs(int h,int j)
{
 for(int i=0;i<4;i++)
 {
  int x=h+dir[i][0];
  int y=j+dir[i][1];
  if(x>=1 && x<=row && y>=1 && y<=column)
  {
   if(a[x][y]=='*')
   {
    area++;
    a[x][y]='.';
    dfs(x,y);
   }
  }
 }
}
int main()
{
 while(scanf("%d%d",&column,&row)!=EOF)
 {
  int i;
  for(i=1;i<=row;i++)
   scanf("%s",a[i]+1);
  int x,y;
  for(x=1;x<=row;x++)
  {
   for(y=1;y<=column;y++)
   {
    if(a[x][y]=='*')
    {
     area=1;
     a[x][y]='.';//这一步是把第一次遇到的‘*’，改为‘。’因为 dfs 中有‘*’变为‘。’所以不用再写一遍
     dfs(x,y);
     ans=max(ans,area);
    }
   }
  }
  printf("%d\n",ans);
 }
 return 0;
}