 |
| ||||
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 | |||||||||
B A Bunch Of MonstersIn Reply To:关于这次比赛: Posted by:atlas_of_rruucc at 2004-09-12 22:34:05 中等难度 经典的贪心问题 按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
