 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
我用的spfa我用的拆点 ，每个点和他自己 + n 连一条边 ，费用是价值，把每一个最低点当成当前最低点 ，每次取得1 到 n+1___n + n 的最小 ，时间太久了100多了，看到有很多0ms的就不好意思吧自己的水代码贴出来了 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
