 |
| ||||
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 | |||||||||
Re:这个做两遍O（N）的DP，2遍O（N）更新，然后O（N）扫描一遍In Reply To:这个做两遍O（N）的DP，2遍O（N）更新，然后O（N）扫描一遍 Posted by:lqp18_31 at 2009-08-07 16:51:07 你的意思是这个复杂度高了吗？ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
