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:二进制背包超时的可以看看这里In Reply To:二进制背包超时的可以看看这里 Posted by:QHearting at 2015-06-01 09:20:17 > 你是不是用STL的max()函数了........ > 把那行改成if(f[i-c]+w>f[i]) f[i] = f[i-c]+w;试试。。。 谢谢大佬 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator