讨论 / DP算法
bobchennan 2008-06-08 01:06:00
点我顶贴 收藏 删除
program p169;

var

sum:array[0..1000000] of longint;

a:array[1..10] of longint;

s,i,j:longint;

begin

for i:=1 to 10 do read(a[i]);

readln;

readln(s);

for i:=1 to s do

sum[i]:=maxlongint;

for i:=1 to s do

for j:=1 to 10 do

if i>=j then

if sum[i-j]+a[j]<sum[i] then

sum[i]:=sum[i-j]+a[j];

write(sum[s]);

end.

#1 ghosta3@2008-06-08 01:06:00
回复 删除
空间挺吓人的
查看更多回复
提交回复