 |
| ||||
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 | |||||||||
Re:此题中，每条路可以经过不超过三次。In Reply To:此题中，每条路可以经过不超过三次。 Posted by:nepepl at 2010-05-14 16:23:34 > 每条路的上限设置为3的时候，用了200多ms，设置为2的时候，16ms。。。特别要注意当N=1的时候，要输出0，在这个情况下WA了3,4次 用dfs，上限为2，0MS.多谢楼主 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
