 |
| ||||
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 | |||||||||
怎么做到0MS呢?按传统的并查集做出来的是16MS 设置一个count[MAX] 来统计每一棵树上的结点数, 再把init()写到main里,不做成函数,相当于宏的效果. 还是16MS 我刚开始看并查集的东西,不知道还有什么好的办法呢? Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
