Free Pascal Compiler version 2.6.2 [2013/02/12] for i386
Copyright (c) 1993-2012 by Florian Klaempfl and others
Target OS: Win32 for i386
Compiling foo.pas
Linking foo.exe
42 lines compiled, 0.2 sec , 28528 bytes code, 1628 bytes data
测试数据 #0: Accepted, time = 0 ms, mem = 612 KiB, score = 10
测试数据 #1: Accepted, time = 0 ms, mem = 608 KiB, score = 10
测试数据 #2: Accepted, time = 0 ms, mem = 616 KiB, score = 10
测试数据 #3: Accepted, time = 0 ms, mem = 612 KiB, score = 10
测试数据 #4: Accepted, time = 0 ms, mem = 608 KiB, score = 10
测试数据 #5: Accepted, time = 0 ms, mem = 616 KiB, score = 10
测试数据 #6: Accepted, time = 0 ms, mem = 612 KiB, score = 10
测试数据 #7: Accepted, time = 0 ms, mem = 612 KiB, score = 10
测试数据 #8: Accepted, time = 0 ms, mem = 612 KiB, score = 10
测试数据 #9: Accepted, time = 15 ms, mem = 616 KiB, score = 10
Accepted, time = 15 ms, mem = 616 KiB, score = 100
代码
var
n,i,j,ans:longint;
f,g,h:array[1..200]of longint;
procedure init;
begin
readln(n);
for i:=1 to n do
begin
read(h[i]);
f[i]:=1;g[i]:=1;
end;
end;

procedure dpone;
begin
for i:=1 to n-1 do
for j:=i+1 to n do
if (h[i]<h[j]) and (f[i]>=f[j]) then f[j]:=f[i]+1;
end;

procedure dptwo;
begin
for i:=n downto 2 do
for j:=i-1 downto 1 do
if (h[i]<h[j]) and (g[i]>=g[j]) then g[j]:=g[i]+1;

end;

procedure print;
begin
ans:=0;
for i:=1 to n do
if ans<f[i]+g[i] then ans:=f[i]+g[i];
ans:=n-ans+1;
writeln(ans);
end;

begin
init;
dpone;
dptwo;
print;
end.

你这个的大方向就错了。这题只要正着、反着做两次动归就行了。