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

1976怎么DP啊?

Posted by thincal at 2004-11-04 00:54:58 on Problem 1976
请教大大们这题是怎么做的啊?
我的想法是首先每N个数相加得到一个和(N指的是一个火车头能够拉的最大的车厢数),保存在一个数组中然后从中选出三个数,并却这三个数的位置关系满足至少相差N个,这样求得一个最大值

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