 |
| ||||
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 | |||||||||
不会那么麻烦啊In Reply To:这题SDOI_Province_Team是如何用0ms做的啊，偶只想到了一个网络流的算法，是不是可以用这个图的某些特殊性质而用贪心解决啊，那位能给个提示啊？ Posted by:BShell at 2003-06-04 08:26:56 我朴素的sap（连gap也没加）就0ms了 图很好构的，n+3个点 －－－－－－－－－－－－－－－－－－－－－－－－－－－－－－ 064004 linusc 1149 Accepted 512K 0MS G++ 1621B 2011-01-02 20:18:47 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
