很简单的dfs /*Poj: 3620 Avoid The Lakes*/#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#define MaxN 105using namespace std;int dirx[4] = {0, 0, -1, 1

D. Lakes in Berland time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The map of Berland is a rectangle of the size n × m

Avoid The Lakes（进入提交） Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7825 Accepted: 4131 Description Farmer John's farm was flooded in the most recent storm, a fact only aggra