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

10几MS的大牛们是怎么做的阿?请教

Posted by soonyu at 2009-08-25 22:16:27 on Problem 2593
我是O(2*n)的  第一遍dp是边读入边处理 反向的时候边dp边记录最大值  感觉已经很快了阿  不知道大牛们用的什么方法阿  莫非只读一遍就能处理出结果?

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