AcWing 898. 数字三角形
原题链接
简单
作者:
我叫尤盖斯
,
2021-01-17 21:59:52
,
所有人可见
,
阅读 338
数字三角形
python
n=int(input())
list1=[]
for i in range(n):
list2=list(map(int,input().split()))
list1.append(list2)
for i in range(n-2,-1,-1):
for j in range(i+1):
list1[i][j]+=max(list1[i+1][j],list1[i+1][j+1])
print(list1[0][0])
c++
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 510;
int n;
int f[N][N];
int main()
{
cin >> n;
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= i; j ++ )
cin >> f[i][j];
for (int i = n - 1; i; i -- )
for (int j = 1; j <= i; j ++ )
f[i][j] += max(f[i + 1][j], f[i + 1][j + 1]);
cout << f[1][1] << endl;
return 0;
}
//by y总