 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
大牛求助，动态规划；现在有m(30 <= m <= 50) 个数字，范围是（1 - 10^9） , 要求划分到n(2 <= n <= m)个堆中，每个堆中所有的数字的和为其权值，求使得最大权值的堆与最小权值的堆的差最小的一种分法； 输出任意一种即可； 感觉是动态规划，但是又不知道怎么下手，求高手赐教； Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
