算法 搜索

刚开始学搜索，感觉好有意思，挺感兴趣的，知道了做题的思路就ac这两个题！

重要的是知道搜索八个或四个方向！！

A - Lake Counting

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
Submit
 
Status
Description
Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water ('W') or dry land ('.'). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors. 


Given a diagram of Farmer John's field, determine how many ponds he has.
Input
* Line 1: Two space-separated integers: N and M 


* Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each character is either 'W' or '.'. The characters do not have spaces between them.
Output
* Line 1: The number of ponds in Farmer John's field.
Sample Input
10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.
Sample Output

3

#include<stdio.h>
#include<string.h>
char s[111][111];
int n,m;
void  dfs(int x,int y)
{
   int nx,ny;
   int dx,dy;
   s[x][y]='.';
   for(dx=-1;dx<=1;dx++)
     for(dy=-1;dy<=1;dy++)
   {
    nx=x+dx;
    ny=y+dy;
    if(nx>=0&&nx<n&&ny>=0&&ny<m&&s[nx][ny]=='W')
    {
        dfs(nx,ny);
    }
   }
}
int main()
{
    int t=0;
    int i,j;
    scanf("%d%d",&n,&m);
    getchar();
    for(i=0;i<n;i++)
       {
        for(j=0;j<m;j++)
    {
        scanf("%c",&s[i][j]);
    }
    getchar();
       }
       for(i=0;i<n;i++)
        for(j=0;j<m;j++)
       {
           if(s[i][j]=='W')
          {
            dfs(i,j);
           t++;}
       }
       printf("%d\n",t);

}

B - Oil Deposits
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u
Submit
 
Status
Description
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each plot separately, using sensing equipment to determine whether or not the plot contains oil. A plot containing oil is called a pocket. If two pockets are adjacent, then they are part of the same oil deposit. Oil deposits can be quite large and may contain numerous pockets. Your job is to determine how many different oil deposits are contained in a grid. 
 
Input
The input file contains one or more grids. Each grid begins with a line containing m and n, the number of rows and columns in the grid, separated by a single space. If m = 0 it signals the end of the input; otherwise 1 <= m <= 100 and 1 <= n <= 100. Following this are m lines of n characters each (not counting the end-of-line characters). Each character corresponds to one plot, and is either `*', representing the absence of oil, or `@', representing an oil pocket. 
 
Output
For each grid, output the number of distinct oil deposits. Two different pockets are part of the same oil deposit if they are adjacent horizontally, vertically, or diagonally. An oil deposit will not contain more than 100 pockets. 
 
Sample Input
 1 1
*
3 5
*@*@*
**@**
*@*@*
1 8
@@****@*
5 5 
****@
*@@*@
*@**@
@@@*@
@@**@
0 0

 题意：问地图中有多少个@，前提如果@的八个方向中如果还是@，则相邻的@不进入计数。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int f[100][100];
char a[100][100];
void dfs(int x,int y)
{
    for(int i=-1;i<=1;i++)
        for(int j=-1;j<=1;j++)
    {
        if(a[x+i][y+j]=='@'&&f[x+i][y+j]==0)
        {
            f[x+i][y+j]=1;
            dfs(x+i,y+j);
        }
    }
}
int main()
{
    int n,m,i,j;
    int sum;
    while(scanf("%d%d",&n,&m)!=EOF)
    { if(m==0&&n==0) break;
        getchar();
        sum=0;
        memset(f,0,sizeof(f));
        memset(a,'*',sizeof(a));
       for(i=1;i<=n;i++)
        {
            for(j=1;j<=m;j++)
            {
                scanf(" %c",&a[i][j]);
            }

        }
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=m;j++)
            {
                if(a[i][j]=='@' && f[i][j]==0)
                {
                    sum++;
                    f[i][j]=2;
                    dfs(i,j);
                }
            }
        }
        printf("%d\n",sum);
    }
}