虽然是DP,但你的程序写的太不好了,以至于复杂度的常数比较大我的:var n,m,i,j,min:longint;
a,f:array[0..1000] of longint;beginreadln(n,m);for i:=1 to m do read(a);f[0]:=0;i:=0;repeat
i:=i+1; min:=maxlongint;
for j:=1 to m do
if i>=a[j] then
if f[i-a[j]]+1<min then min:=f[i-a[j]]+1;
f:=min;u