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 |
Re:这个思路有问题不?一直WAIn Reply To:这个思路有问题不?一直WA Posted by:BrookeBanner at 2009-03-15 17:27:25 > 将N个物品放入容量M的背包中使得背包恰好装满的情况下 总价值的绝对值最小 > 每个物品的价值定义为p[i]-d[i] > 然后用0-1背包DP的思路 > > 可是一直WA 懂了 举个反例就好了 3 2 1 3 2 1 3 1 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator