题目大意是给定n个数,移除每个数的代价是其与左右两数的乘积,求移除剩两个数的需要花费的最小代价。
很典型的石子归并的DP模型。状态转移方程是f[i,j]=min(f[i,j],f[i,k]+f[k,j]+num[i]*num[k]*num[j])(1<=i<k<j<=n);f[i,j]表示从第i个数到第j个数移除剩两个数需要花费的最小代价,num[i]表示第i个数。
1648919 2008-09-21 00:05:57 Accepted 1602 FPC 0 436 IwfWcf
题目大意是给定n个数,移除每个数的代价是其与左右两数的乘积,求移除剩两个数的需要花费的最小代价。
很典型的石子归并的DP模型。状态转移方程是f[i,j]=min(f[i,j],f[i,k]+f[k,j]+num[i]*num[k]*num[j])(1<=i<k<j<=n);f[i,j]表示从第i个数到第j个数移除剩两个数需要花费的最小代价,num[i]表示第i个数。
1648919 2008-09-21 00:05:57 Accepted 1602 FPC 0 436 IwfWcf
toms outlet, http://www.tomsoutlet-stores.com/
回复删除nike roshe, http://www.nikerosherunshoes.co.uk/
prada handbags, http://www.pradahandbagsoutlet.co.uk/
soccer jerseys, http://www.cheapsoccerjersey.net/
michael kors outlet store, http://www.michaelkorsoutlet-store.us.com/
true religion jeans, http://www.truereligionjeansoutlets.us.com/
oakley sunglasses, http://www.oakleysunglasses-outlet.us.com/
nike free 5, http://www.nikefree5.us/
louis vuitton bags, http://www.louisvuittonbag.us.com/
chanel handbags, http://www.chanelhandbags-outlet.co.uk/
chanel handbags, http://www.chanelhandbags-outlet.us.com/
louis vuitton handbags, http://www.louisvuittonhandbag.us/
louis vuitton outlet, http://www.louisvuittonoutlet.in.net/
ghd hair straighteners, http://www.ghdhairstraightenerssale.co.uk/
nba jerseys, http://www.nbajerseys.us.com/
coach outlet, http://www.coachoutletstores.com.co/
true religion jeans, http://www.truereligionjeanscanada.com/
swarovski crystal, http://www.swarovskicrystals.co.uk/
mbt shoes, http://www.mbtshoesoutlet.us.com/
michael kors handbags, http://www.michaelkorshandbags.in.net/
chanel handbags, http://www.chanelhandbagsoutlet.in.net/
michael kors outlet online, http://www.michaelkorsoutletonline.in.net/
polo ralph lauren, http://www.poloralphlauren.us.org/
the north face clearance, http://www.thenorthfaceclearances.us.com/
jordan shoes, http://www.jordan-shoes.us.com/
beats by dr dre, http://www.beatsbydrdre-headphones.us.com/
the north face uk, http://www.thenorthfaces.org.uk/
1003maoqiuyun