 |
| ||||
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 | |||||||||
我的就是N*N，不过优化后要少的多Re:B A Bunch Of MonstersIn Reply To:B A Bunch Of Monsters Posted by:atlas_of_rruucc at 2004-09-12 22:38:32 不过跟数据简单也有关系 > 中等难度 > > 经典的贪心问题 > 按Si从大到小排序然后尽量的放 > > 需要用到等价类或者堆把O（N*N）优化到O（NLogN） > 可能N*N写的好也能过 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
