/ Vijos / 讨论 / 过河 /

求助???????????????

Var

i,j,l,s,x,t,m,min:longint;

a,b:array[0..100] of longint;

c:array[1..10000] of longint;

f:array[1..100,0..10000] of longint;

Begin

readln(l);

readln(s,t,m);

a[0]:=0;

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

if s=t then begin

for i:=1 to m do

if a[i] mod s=0 then inc(min);

end else begin

for i:=1 to m do

if a[i]-a>72 then b[i]:=a+72 else b[i]:=a[i];

if l-b[m]>72 then l:=b[m]+t+s;

for i:=1 to m do begin f[1,b[i]]:=1; c[b[i]]:=1; end;

for i:=2 to l div s do

for j:=1 to l do begin

min:=maxlongint;

f:=f;

if (j>=i*s) and (j=x) and (j-xs-1) then

if f

1 条评论

  • 1

信息

ID
1002
难度
7
分类
动态规划 点击显示
标签
递交数
25264
已通过
4390
通过率
17%
被复制
76
上传者