思路 :
很简单的搜索题,求连通分块数目啦,想想蓝桥杯省赛用Dev调的那道天气变暖就好气好气,略略略~
代码 :
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int Max_n=330;
int n,m;
char s[Max_n][Max_n];
bool vis[Max_n][Max_n];
int dx[4]={0,0,-1,1};
int dy[4]={1,-1,0,0};
void dfs(int x,int y,char c){
for(int i=0;i<4;i++){
int X=x+dx[i];
int Y=y+dy[i];
if(!vis[X][Y]&&s[X][Y]==c){
vis[X][Y]=1;
dfs(X,Y,c);
}
}
}
int main()
{
while(~scanf("%d%d",&n,&m)&&n+m!=0){
memset(s,0,sizeof(s));
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++)scanf("%s",s[i]+1);
int ans=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(!vis[i][j]){
ans++;
vis[i][j]=1;
dfs(i,j,s[i][j]);
}
}
}
printf("%d\n",ans);
}
return 0;
}