Farm Tour POJ - 2135（最小費用最大流）

When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of which contains t

>>阅读原文<<