Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:福州那题难。这题可以直接搜索出i,j之间的最大边。

Posted by JiaJunpeng at 2014-07-17 23:33:46 on Problem 2831
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:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator