noip2004合唱队形2008.11.4

noip2004合唱队形2008.11.4

注意：

一定要把求的得值都打出来，还要单步跟踪，不能认为自己一定就对了！！！

program chorus;
const fin='chorus.in';fout='chorus.out';
      maxn=100;
var a:array[1..maxn]of longint;
    f,g:array[1..maxn]of longint;
    f1,f2:text;
    n,i,j:longint;
procedure init;
var i:longint;
begin
  assign(f1,fin);reset(f1);
  assign(f2,fout);rewrite(f2);
  read(f1,n);
  for i:=1 to n do
    read(f1,a[i]);
  fillchar(f,sizeof(f),0);
  fillchar(g,sizeof(g),0);
end;
procedure dp;
var i,j,max:longint;
begin
   max:=0;
   for i:=1 to n do
     begin f[i]:=1;g[i]:=1;end;
   for i:=n-1 downto 1 do
     for j:=i+1 to n do
       if (a[j]<a[i])and(f[j]+1>f[i]) then f[i]:=f[j]+1;
   for i:=2 to n do
      for j:=1 to i-1 do
        if (a[j]<a[i])and(g[j]+1>g[i]) then g[i]:=g[j]+1;
   for i:=1 to n do
     if (f[i]+g[i]>max) then max:=f[i]+g[i];
{   for i:=1 to n do
     write(f[i]:5);
     writeln;
   for i:=1 to n do
     write(g[i]:5);
     writeln;}
   writeln(f2,n-max+1);
   close(f1);close(f2);
end;
begin
  init;
  dp;
end.