Thieves HDU - 3491(最小点割集)
In the kingdom of Henryy, there are N (2 <= N <= 100) cities, with M (M <= 10000) two-direct ways connecting them.
A group of thieves from abroad plan to steal the metropolitan museum in city H (It h
原创
2017-11-08 16:19:16 ·
382 阅读 ·
0 评论