Description: 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.
To Search:
File list (Check if you may need any files):
hdu4859.cpp