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 |
唔,用一个单调队列来维护lcp,然后每次O(n)修改,然后一共最多n次操作居然没TLE。唔唔,用一个单调队列来维护lcp,然后每次O(n)修改,然后一共最多n次操作居然没TLE。唔。。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator