 |
| ||||
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 | |||||||||
算法没错，不过要注意一个trick。数据出的好，考你细心：）In Reply To:我是建树做的，但一直WA，是算法不对吗？ Posted by:SeedJYH at 2005-10-16 18:20:37 > 先建立一棵以节点1为根的（图）树，然后最短路程=（图的所有边的权值）*2，可能的种数=全部分支节点的子节点数的阶乘的乘积 > 不是这么做的吗？ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
