#5 renqing@2008-07-24 19:14:00
2585
回复
删除
公告 Announcement : 恢复测评(PID172-207暂时不测评,请勿提交)……;RQNOJ一周年邀请赛通知
#6 shuizilong96@2008-08-14 01:43:00
4505
回复
删除
const max=10000;
var n,m,i,j:longint;
a,b:array [1..max] of integer;
c:array [0..max] of longint;
begin
readln(m,n);
for i:=1 to n do
readln(a[i],b[i]);
for i:=1 to n do
for j:=m downto a[i] do
if c[j-a[i]]+b[i]>c[j] then c[j]:=c[j-a[i]]+b[i];
write(c[m]);
end.
数组不够大
#8 Jollwish@2008-08-14 06:21:00
4527
回复
删除
var p:array[1..10000]of longint;
i,j,a,b,n,m:longint;
begin
readln(n,m);
for i:=1 to m do
begin
readln(a,b);
for j:=n downto a do if p[j-a]+b>p[j] then p[j]:=p[j-a]+b;
end;
write(p[n]);
end.