题目链接：
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2412
题目：
Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square has a different type of pipe. There are 11 types of pipes, which is marked from A to K, as Figure 1 shows.
Figure 1
Benny has a map of his farm, which is an array of marks denoting the distribution of water pipes over the whole farm. For example, if he has a map
ADC FJK IHE
then the water pipes are distributed like
Figure 2
Several wellsprings are found in the center of some squares, so water can flow along the pipes from one square to another. If water flow crosses one square, the whole farm land in this square is irrigated and will have a good harvest in autumn.
Now Benny wants to know at least how many wellsprings should be found to have the whole farm land irrigated. Can you help him?
Note: In the above example, at least 3 wellsprings are needed, as those red points in Figure 2 show.
Input
There are several test cases! In each test case, the first line contains 2 integers M and N, then M lines follow. In each of these lines, there are N characters, in the range of 'A' to 'K', denoting the type of water pipe over the corresponding square. A negative M or N denotes the end of input, else you can assume 1 <= M, N <= 50.
<b< dd="">
Output
For each test case, output in one line the least number of wellsprings needed.
<b< dd="">
Sample Input
2 2 DK HF 3 3 ADC FJK IHE -1 -1
<b< dd="">Sample Output
2 3
题意描述：
输入矩阵的大小和字母表示的矩阵，表示不同型号的水管摆成的形状
解题思路：
题目还是很有意思的，实际就是找找有几个独立的连通区域。将对应字母型号的水管四个方向的状态存进数组，使用广搜遍历每个水管，判断在其方向上的水管的对应方向的状态即可。
代码实现：
1 #include<stdio.h> 2 #include<string.h> 3 char map[550][550]; 4 int m,n,book[550][550]; 5 void bfs(int x,int y,int c); 6 struct n 7 { 8 int x,y; 9 }; 10 int main() 11 { 12 int i,j,c; 13 while(scanf("%d%d",&m,&n), n!=-1 && m!= -1) 14 { 15 for(i=0;i<m;i++) 16 for(j=0;j<n;j++) 17 scanf(" %c",&map[i][j]); 18 19 memset(book,0,sizeof(book)); 20 for(c=0,i=0;i<m;i++){ 21 for(j=0;j<n;j++){ 22 if(book[i][j]==0) 23 bfs(i,j,++c); 24 } 25 } 26 printf("%d ",c); 27 } 28 return 0; 29 } 30 void bfs(int sx,int sy,int c) 31 { 32 struct n q[260000]; 33 int i,tx,ty,head=1,tail=1,k; 34 int next[4][2]={0,1, 1,0, 0,-1, -1,0}; 35 int list[6]={0,1,2,3,0,1}; 36 37 int alp[11][4]={0,0,1,1, 1,0,0,1, 0,1,1,0, 1,1,0,0, 0,1,0,1, 1,0,1,0, 38 1,0,1,1, 0,1,1,1, 1,1,1,0, 1,1,0,1, 1,1,1,1};//A到K的水管，每4个数表示一个水管，分别是右、下、左、上的状态 39 q[tail].x=sx; 40 q[tail].y=sy; 41 tail++; 42 book[sx][sy]=c; 43 while(head<tail) 44 { 45 for(k=0;k<=3;k++) 46 { 47 tx=q[head].x + next[k][0]; 48 ty=q[head].y + next[k][1]; 49 if(tx<0 || tx>=m || ty<0 || ty>=n)//设置边界 50 continue; 51 if(alp[ map[ q[head].x ][ q[head].y ]-'A' ][list[k]] && alp[ map[tx][ty]-'A' ][ list[k+2] ] && !book[tx][ty]) 52 {//对准位置 53 book[tx][ty]=c; 54 q[tail].x=tx; 55 q[tail].y=ty; 56 tail++; 57 } 58 } 59 head++; 60 } 61 }
易错分析：
1、注意遍历方向的时候要对准每个水管的对应方向的状态
2、边界设置要准确