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

水题花了好久……

Posted by gympp at 2011-08-01 15:27:21 on Problem 3267
f[i]= min (f[i-1]+1, f[k]+w(k+1,i)) w表示k+1~i匹配成功需要删除的最少个数
本来枚举了k,结果超时。。改成从i开始直接往前匹配63ms 汗。。

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