递增子序列最大和

var a:array[1..100] of longint;
    f:array[1..100] of longint;
    n,i,j,ans:longint;
function max(x,y:longint):longint;
begin
  if x>y then exit(x) else exit(y);
end;
begin
  readln(n);
  fillchar(f,sizeof(f),0);
  for i:=1 to n do read(a[i]);
  f[1]:=a[1];//这句话应该放在数组读完数后面
  for i:=2 to n do
   begin
    for j:=1 to i-1 do
     if a[i]>a[j] then f[i]:=max(f[j],f[i]);
    f[i]:=f[i]+a[i];
   end;
  ans:=0;
  for i:=1 to n do
   if f[i]>ans then ans:=f[i];
  writeln(ans);
end.