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:除了容斥原理还有别的做法能过么?搜索、DP可不可以?In Reply To:除了容斥原理还有别的做法能过么?搜索、DP可不可以? Posted by:soonyu at 2009-06-07 16:37:33 > 我用DP做 O(n^2)的 剪枝是如果输入有N的倍数就直接输出 结果LTE > > 不知道有没有别的算法好使啊? 输入数据N10000 , n2的算法怎么过的了? Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator