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 |
解题报告的时间复杂度怎么感觉是n^5 ???无限TLE中...设f[i][j]是substring[i][j]可以到达的产生式左端 在计算f[i][i+k-1]的时候 怎么看都是 等于f[i][j] 和f[j+1][i+k-1]的组合 这个时候时间复杂度不就近似于n^5=n^3*n^2了么? 难道我把解体报告理解错了? HELP Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator