HDU -1151 二分匹配與DAG圖（最小覆蓋路徑）

Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's streets you can

>>阅读原文<<