Chinaunix首页 | 论坛 | 博客
  • 博客访问: 182221
  • 博文数量: 48
  • 博客积分: 4060
  • 博客等级: 上校
  • 技术积分: 1080
  • 用 户 组: 普通用户
  • 注册时间: 2007-12-23 23:24
文章分类

全部博文(48)

文章存档

2011年(1)

2010年(8)

2009年(2)

2008年(37)

我的朋友

分类: C/C++

2008-05-02 22:57:29

题目意思:
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.
解题思路:dfs
code:
#include
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  count=0; 
  for(i=0;i  for(j=0;j  {
  if(ch[i][j]=='@')
  {search(i,j);count++;}               
  }                    
  printf("%d\n",count);      
  }   
}
阅读(4023) | 评论(0) | 转发(0) |
0

上一篇:hdu 1688 Sightseeing

下一篇:hdu 1754 I hate it

给主人留下些什么吧!~~