Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

唔,用一个单调队列来维护lcp,然后每次O(n)修改,然后一共最多n次操作居然没TLE。唔

Posted by mzry1992 at 2011-12-04 17:44:14 on Problem 3415
唔,用一个单调队列来维护lcp,然后每次O(n)修改,然后一共最多n次操作居然没TLE。唔。。

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator