PKU1157 little shop of flowers

       跟刚才做的那个题基本一个模板…可以说是把邮局变成了花，把村庄变成了花瓶…

program flower; const inf=200000000; var data,f:array[0..101,0..101] of longint; n,m,i,j,k,ans:longint; function getmax(a,b:longint):longint; begin if a>b then exit(a); exit(b); end; begin assign(input,'a.in'); reset(input); assign(output,'a.out'); rewrite(output); readln(n,m); for i:=1 to n do for j:=1 to m do read(data[i,j]); filldword(f,sizeof(f) shr 2,-inf); for j:=0 to m do f[0,j]:=0; for i:=1 to n do for j:=i to m do for k:=i-1 to j-1 do f[i,j]:=getmax(f[i-1,k]+data[i,j],f[i,j]); ans:=-inf; for j:=n to m do ans:=getmax(ans,f[n,j]); writeln(ans); close(input); close(output); end.