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 |
恶心啊……先是写O(C^3logN)的矩乘,被卡时限了,后来注意到比较大的N可以缩小,只要奇偶性不变就行,但是100^3*log1000还是TLE……再后来才意识到当N=1000时朴素的DP是比矩乘快的…… 7次才AC啊…… Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator