中望龙腾笔试题：寻找一张图最大的水域

// ConsoleApplication1.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <iostream>
using namespace std;

#define row 10
#define column 5
//地图数据
int water[row][column]={
	1,0,0,1,1, 
	1,0,1,0,0,
	1,1,1,1,1, 
	1,0,1,0,0,
	1,1,1,1,1, 
	0,0,1,0,0,
	1,1,0,1,1, 
	1,0,1,0,0,
	1,0,0,1,1, 
	1,0,1,0,0,
};
//地图水的大小
int num[row][column] = {0};
//地图的标志
struct Flag
{
	enum Enum
	{
		eNotMarked = 0,
		eMarked = 1,
	};
};
//地图标志的组合
Flag::Enum Flags[row][column];
//寻找水域
void found(int i, int j, int& count)
{
	if((i < 0 || i >= row) || (j < 0 || j >= row))
		return;
	if(Flags[i][j] == Flag::eNotMarked)
	{
		Flags[i][j] = Flag::eMarked;
		if(water[i][j] == 1)
		{
			++count;
			found(i+1,j,count);
			found(i-1,j,count);
			found(i,j+1,count);
			found(i,j-1,count);
		}		
	}
}


int _tmain(int argc, _TCHAR* argv[])
{
	//遍历整个地图
	for(int i = 0; i < row; ++i)
	{
		for(