tyvj__部分题解代码.docVIP

p1008 var f:array[1..100,0..100]of longint; i,k,m,n,j:longint; begin read(n,m); f[1,1]:=0;f[1,2]:=1;f[1,0]:=1; for i:=2 to m do for j:=0 to n-1 do f[i,j]:=f[i-1,(j-1+n)mod n]+f[i-1,(j+1)mod n ]; write(f[m,1]); end. P1014 uses math; var f:array[1..100,1..100]of longint; i,j,k,m,n,p,min1:longint; head,tail:array[1..100]of longint; begin read(n);min1:=maxlongint; for i:=1 to n do read(head[i]); for i:=1 to n-1 do tail[i]:=head[i+1]; tail[n]:=head[1]; {for i:=n+1 to 2*n-1 do Begin head[i]:=head[i-n]; tail[i]:=tail[i-n]; end;} for p:=1 to n-1 do for i:=1 to n-1 do begin j:=p+i; if jn then break; for k:=i to j-1 do if f[i,j]0 then f[i,j]:=min(f[i,j],f[i,k]+f[k+1,j]+head[i]*tail[k]*tail[j]) else f[i,j]:=max(f[i,j],f[i,k]+f[k+1,j]+head[i]*tail[k]*tail[j]); end; write(f[1,n-1]); end. P1024 uses math; var a:array[a..z]of integer; i,j,k,m,n:longint; s0:string; s:array[1..1000]of string; procedure init; var i,j:longint; begin for i:=1 to length(s0) do a[s0[i]]:=i; end; procedure qq; var i,j:longint; begin k:=1; for i:=1 to length(s0) do begin if s0[i] then s[k]:=s[k]+s0[i]; if s0[i]= then inc(k); end; end; procedure dfs(i:longint); var k,ii,jj,l,max1:longint; b,f:array[1..1000]of integer; begin fillchar(f,sizeof(f),0); fillchar(b,sizeof(b),0); max1:=0; for ii:=1 to length(s[i]) do b[ii]:=a[s[i][ii]]; l:=length(s[i]); for ii:=1 to l do f[ii]:=1; for ii:=1 to l do for jj:=ii+1 to l do begin if b[jj]=b[ii] then f[jj]:=max(f[jj],f[ii]+1); end; for ii:=1 to l do max1:=max(max1,f[ii]); write(max1); end; begin assign(input,aa.in);reset(input); readln(s0); init; readln(s0); qq; for i:=1 to k d o dfs(i); end. P1029 uses math; var s0,s1:string; i,j,k,m,n,max1:longint; function check(s0,s1:string;i,l0,l1:longint):longint; var j,k,tt:longint; begin k:=1;tt:=0; for j:=i to l1 do begin if s1[j]=s0[k] then begin inc(tt);inc(k);end else if s1[j]s0[k] then begin check:=