1 条题解
-
0
Pascal :
var n,i,j:longint; a,p:array[0..200,0..200]of longint; begin readln(n); for i:=1 to n do for j:=1 to i do read(a[i,j]); for i:=1 to n do p[n,i]:=a[n,i]; for i:=n-1 downto 1 do for j:=1 to i do if p[i+1,j]>p[i+1,j+1] then p[i,j]:=p[i+1,j]+a[i,j]else p[i,j]:=a[i,j]+p[i+1,j+1]; writeln(p[1,1]); end.
- 1
信息
- ID
- 386
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- 10
- 标签
- 递交数
- 2
- 已通过
- 0
- 上传者