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:不能dp,不能贪心,因为没有最优子结构

Posted by yy17yy at 2010-12-10 07:10:12 on Problem 1018
In Reply To:Re:不能dp,不能贪心,因为没有最优子结构 Posted by:KeepOnAC at 2010-11-22 15:15:49
> 最优子结构还是有的
> 在给定带宽下求最小的价格和
> dp[i][j]
> i,考虑到第几个设备。
> j,带宽。


可是你这个方程是什么???我实在是想不出来,,,我也看了前面的一些人写的代码..没有都看,,,可那根本不是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