dp专题之 B - Islands and Bridges POJ - 2288_ac_Linux_greenbride的博客

Given a map of islands and bridges that connect these islands, a Hamilton path, as we all know, is a path along the bridges such that it visits each island exactly once. On our map, there is also a positive integer value associated with each island. We call a Hamilton path the best triangular Hamilton path if it maximizes the value described below. Given a map of islands and bridges that connect