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

Re:求教大牛!

Posted by dodowater at 2009-02-08 16:19:21 on Problem 1505
In Reply To:求教大牛! Posted by:ct314171238 at 2008-08-12 19:16:31
> 我是这样想的,用s[i][j]来保存前i个人分配前j本书时所能得到的最优值。这样就很容易得到状态转移方程了,即s[i][j]=min(max(sigema(l->j),s[i-1][l-1]),s[i][j]),但是这样就不知道该怎么处理当值一样是的情况。
> 如
> 9 8
> 1 2 3 4 5 6 7 8 9
> 我的结果是1 2 / 3 / 4 / 5 / 6 / 7 / 8 / 9 
> 可是答案应该是1 / 2 / 3 / 4 5 / 6 / 7 / 8 / 9
> 在顺序处理的时候s[3][2]时已经将1 2 3分配为1 2 / 3了,之后就无法再更改这个分配了。
> 
> 请哪位牛哥给小弟指点一下,谢谢啦

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