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 |
您的PST到底是什么法宝啊?In Reply To:Re:请问这个题目怎么做,想不出低于N^2的算法... Posted by:uni at 2004-12-17 21:41:13 > 有一体叫BLANCE ACT,这里就是每次取BLANCE ACT的那个点做根,然后砍,变成森林,然后继续 > > 我的算法其实是很慢的,只是我的砍树是用我自己的PST做的.所以勉强不超 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator