var i,j,n,max:longint;

a,f,s:array[1..101]of longint;

begin

readln(n);

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

for i:=1 to n do begin f[i]:=1; s[i]:=1; end;

for i:=1 to n do begin

max:=0;

for j:=1 to i-1 do

if (a[i]>a[j])and (f[j]>max) then max:=f[j];

f[i]:=max+f[i];

end;

for i:=n downto 1 do begin

max:=0;

for j:=n to i+1 do

if (s[j]>max) and (a[i]>a[j]) then max:=s[j];

s[i]:=max+s[i];

end;

max:=0;

for i:=1 to n do if f[i]+s[i]>max then max:=f[i]+s[i];

writeln(n-max+1);

解决。另注意该类问题不用发源码。