 |
| ||||
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:福州那题难。这题可以直接搜索出i,j之间的最大边。In Reply To:福州那题难。这题可以直接搜索出i,j之间的最大边。 Posted by:yygy at 2014-07-17 23:30:27 记得某年成都赛区出过一道 去掉一个点 求最小生成树的： http://cstest.scu.edu.cn/soj/problem.action?id=3878.. 这个更变态。。。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
