PKU3051 Satellite Photographs 简单DFS

最新推荐文章于 2014-12-03 21:43:03 发布

原创最新推荐文章于 2014-12-03 21:43:03 发布 · 837 阅读

CC 4.0 BY-SA版权

文章标签：

/*Satellite Photographs
Time Limit: 1000MS        Memory Limit: 65536K
Total Submissions: 1255        Accepted: 595

Description
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.

Input
* 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.

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

Sample Input

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

Sample Output

16

Source
USACO 2005 November Bronze

*/

#include <iostream>
#include <vector>
using namespace std;

class pas
{
public:
    int sign;
    char value;
};

int count;
void solution(vector<vector<pas> > &pasture,int w,int h,int ii,int jj)
{
    extern int count;
    count++;
    pasture[ii][jj].sign = 1;
    if(jj - 1 >= 0 && pasture[ii][jj - 1].sign == 0 && pasture[ii][jj - 1].value == '*' )
    {
        solution(pasture,w,h,ii,jj - 1);


    }
    if(jj + 1 < w && pasture[ii][jj + 1].sign == 0 && pasture[ii][jj + 1].value == '*')
    {
        solution(pasture,w,h,ii,jj + 1);


    }
    if(ii - 1 >= 0 && pasture[ii - 1][jj].sign == 0 && pasture[ii - 1][jj].value == '*')
    {
        solution(pasture,w,h,ii - 1,jj);


    }
    if(ii + 1 < h && pasture[ii + 1][jj].sign == 0 && pasture[ii + 1][jj].value == '*')
    {
        solution(pasture,w,h,ii + 1,jj);


    }
    return;
}

int main(void)
{
    int w,h;
    cin>>w>>h;
    int largest = 0;
    extern int count;
    count = 0;
    vector<vector<pas> > pasture(h,vector<pas>(w));
    for(int i = 0;i < h;i++)
    {
        for(int j = 0;j < w;j++)
        {
            cin>>pasture[i][j].value;
            pasture[i][j].sign = 0;
        }
    }
    for(int ii = 0;ii < h;ii++)
    {
        for(int jj = 0;jj < w;jj++)
        {
            if(pasture[ii][jj].sign == 0 && pasture[ii][jj].value == '*')
            {
                solution(pasture,w,h,ii,jj);
            }
            if(largest < count)
            {
                largest = count;
            }
            count = 0;
        }
    }

    cout<<largest<<endl;

    return 0;
}