hdu4859的ac源码。算法：最大流最小割。题意：题意：假设地图为一个N*M的格子，其中一些是陆地，一些是可以填充的浅海域，一些是不可填充的深海域。这里定义海岸线的长度为一个联通块陆地（可能包含浅海域填充变为的陆地）的边缘长度，两个格子至少有一个公共边，则视为联通。

值得注意的是，这里Z市的陆地区域可以是不联通的，并且整个地图都处在海洋之中，也就是说，Z市是由一些孤岛组成的，比如像，夏威夷？

你的任务是，填充某些浅海域，使得所有岛屿的海岸线之和最长。



输出最长海岸线和。-AC source of hdu 4859. Algorithms: maximum flow. Title meaning: meaning of the questions: Suppose map for an N* M grid, some of which are on land, some of which are filled with shallow waters, some of which are not filled with deep waters. The length of the coastline here is defined as a block of land Unicom (may contain shallow waters into the land fill) the edge length, the two have a common edge grid at least, is considered China Unicom.

It is worth noting that the city s land area where Z can not Unicom, and the entire map are in the ocean, that is, Z City is composed by a number of islands, like Hawaii?

Your task is to fill some of the shallow waters, making the sum of the longest coastline of all islands.



Output and the longest coastline.