 |
| ||||
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 | |||||||||
D 火力防御网In Reply To:关于这次比赛: Posted by:atlas_of_rruucc at 2004-09-12 22:34:05 有点难 比较好的一个DP问题 复杂度本来是O(N*N*M) 但是可以用二分降到O（N*M*LogN） 可能O（N*N*M）写的好也能过 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
