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^3)复杂度能过?In Reply To:有问题吧。。。O(n^3)复杂度能过? Posted by:allen4053040allen at 2011-08-12 17:41:38 是啊 我也奇怪o(n3)加二分竟然100msAC了。。。十亿啊。。可能是规模大的数据都是有解的 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator