J - 10 C++

题目：

A while ago I had trouble sleeping. I used to lie awake, staring at the ceiling, for hours and hours. Then one day my grandmother suggested I tried counting sheep after I'd gone to bed. As always when my grandmother suggests things, I decided to try it out. The only problem was, there were no sheep around to be counted when I went to bed. 


Creative as I am, that wasn't going to stop me. I sat down and wrote a computer program that made a grid of characters, where # represents a sheep, while . is grass (or whatever you like, just not sheep). To make the counting a little more interesting, I also decided I wanted to count flocks of sheep instead of single sheep. Two sheep are in the same flock if they share a common side (up, down, right or left). Also, if sheep A is in the same flock as sheep B, and sheep B is in the same flock as sheep C, then sheeps A and C are in the same flock. 


Now, I've got a new problem. Though counting these sheep actually helps me fall asleep, I find that it is extremely boring. To solve this, I've decided I need another computer program that does the counting for me. Then I'll be able to just start both these programs before I go to bed, and I'll sleep tight until the morning without any disturbances. I need you to write this program for me.

InputThe first line of input contains a single number T, the number of test cases to follow. 

Each test case begins with a line containing two numbers, H and W, the height and width of the sheep grid. Then follows H lines, each containing W characters (either # or .), 

思路：

看似数羊，其实只是用DFS求连通块。

代码：

#include<iostream>
using namespace std;
char a[105][105];
int t,h,w;
void dfs(int x,int y)
{
    a[x][y]='.';
    int dx[4]={0,0,1,-1},dy[4]={1,-1,0,0};
    for(int i=0;i<4;i++)
    {
        int nx=x+dx[i],ny=y+dy[i];
        if(0<=nx&&nx<h&&0<=ny&&ny<w&&a[nx][ny]=='#')dfs(nx,ny);
    }
    return ;
}
int main()
{
    cin>>t;
    while(t--)
    {
        int res=0;
        cin>>h>>w;
        int i,j;
        for(i=0;i<h;i++)
        {
            for(j=0;j<w;j++)
            {
                cin>>a[i][j];
            }
        }
        for(i=0;i<h;i++)
        {
            for(j=0;j<w;j++)
            {
                if(a[i][j]=='#')
                {
                    dfs(i,j);
                    res++;
                }
            }
        }
        cout<<res<<endl;
    }
    return 0;
}