poj 3051是一道很基础甚至有些水的题,很适合初学者入手!
题目如下:Satellite Photographs
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.
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.
* 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
代码如下:
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
char a[1500][1500]; //一定要定义两个不同类型的数组
int newA[1500][1500];
int num;
void dfs(int x,int y)//深搜
{
if(newA[x][y]==1)
{
newA[x][y]=0;
num++;
dfs(x,y+1);
dfs(x,y-1);
dfs(x+1,y);
dfs(x-1,y);
}
}
int main()
{
int max=0,m,n,i,j;
char con;
num=0;
cin>>m>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
cin>>con;
if(con=='*') // 对输进来的符号进行转换成0或1。
newA[i][j]=1;
else
newA[i][j]=0;
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
num=0;
dfs(i,j);
if(num>=max)
max=num;
}
}
cout<<max<<endl;
return 0;
}