 |
| ||||
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:能讲下1ms以内的方法吗？In Reply To:能讲下1ms以内的方法吗？ Posted by:jackjack at 2005-07-07 13:32:36 分四个方向分别DP，o（n^2）的算法复杂度，不过超难写，小菜写了200+行代码，瞬间WA了，如果你能写出来，几乎可以肯定是0MS（<1MS）…… Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
