 |
| ||||
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 | |||||||||
这题数据可能水了，特判掉s=0的情况之后，剩下的数据最多只切了166刀，n*n*n的dp可以斜率优化到166*n的复杂度500ms水过。还是去学O(n)的dp+斜率优化吧。这题数据可能水了，特判掉s=0的情况之后，剩下的数据最多只切了166刀，n*n*n的dp可以斜率优化到166*n的复杂度500ms水过。还是去学O(n)的dp+斜率优化吧。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
