p1098.pas

www.vijos.cn上一些习题的参考源码

program p1098;
var
	i,j,n,max:integer;
	t,up,down:array[1..100] of integer;
	
begin
	readln(n);
	for i:=1 to n do
		read(t[i]);
	up[1]:=1;
	for i:=2 to n do begin
        for j:=1 to i-1 do begin
    		if (t[j]<t[i]) and (up[j]+1>up[i]) then
	       		up[i]:=up[j]+1;
        end;
	end;
	
	down[n]:=1;
	for i:=n-1 downto 1 do begin
        for j:=n downto i+1 do begin
		if (t[j]<t[i]) and (down[j]+1>down[i]) then
			down[i]:=down[j]+1
        end;
	end;
	max:=0;
	for i:=1 to n do
        if up[i]+down[i]>max then max:=up[i]+down[i];
    writeln(n-max+1);
end.