HBC24145刺客信条[USACO 2011 Dec S]Roadblock题解 （everymorning,fjwakesupandwalksacross）

想要成为编程高手？那就来试试全网最全C++题库，让您在练习中快速成长。

Every morning, FJ wakes up and walks across the farm from his house to the barn. The farm is a collection of N fields (1

Every morning, FJ wakes up and walks across the farm from his house to the barn.  The farm is a collection of N fields (1 <= N <= 100) connected by M bidirectional pathways (1 <= M <= 10,000), each with an associated length.  FJ's house is in field 1, and the barn is in field N.  No pair of fields is joined by multiple redundant pathways, and it is possible to travel between any pair of fields in the farm by walking along an appropriate sequence of pathways.  When traveling from one field to another, FJ always selects a route consisting of a sequence of pathways having minimum total length. Farmer John's cows, up to no good as always, have decided to interfere with FJ's morning routine.  They plan to build a pile of hay bales on exactly one of the M pathways on the farm, doubling its length.  The cows wish to select a pathway to block so that they maximize the increase in FJ's distance from the house to the barn.  Please help the cows determine by how much they can lengthen FJ's route.

不断学习，不断挑战，才能在编程领域中脱颖而出！全网最全C++题库，助您成为编程高手！

标签： HBC24145刺客信条[USACO 2011 Dec S]Roadblock题解