帮忙解答道ACM题目谢谢

来源：百度知道 编辑：UC知道 时间：2024/05/28 12:56:24
高分求解 最好带有源程序的谢了 UVA上的题目
oil deposite
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 and . Following this are m lines of n characters each (not counting the end-of-line charac

#include<stdio.h> int p[8][2]={{0,1},{0,-1},{1,0},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1}}; char ch[101][101]; int m,n; void search(int x,int y){ int i,xx,yy; for(i=0;i<8;i++){ xx=x+p[i][0];yy=y+p[i][1]; if(xx<0||xx>=m||yy<0||yy>=n) continue; if(ch[xx][yy]=='*')continue; ch[xx][yy]='*'; search(xx,yy); } } int main(){ int i,j,count; while(scanf("%d%d",&m,&n)&&m+n){ for(i=0;i<m;i++) scanf("%s",ch[i]); count=0; for(i=0;i<m;i++){ for(j=0;j<n;j++){ if(ch[i][j]=='@'){ search(i,j); count++; }