| ||||||||||
| 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 | |||||||||
那每一对BX是单独考虑吗,不需要考虑其他箱子的阻碍?(晕,重发一遍)In Reply To:每一对BX的最短路做权,求所有B和所有X的最优匹配 Posted by:frkstyc at 2005-08-07 14:17:51 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator