Description
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
(Figure 1)
Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the left or diagonally down to the right.
Input
Your program is to read from standard input. The first line contains one integer N: the number of rows in the triangle. The following N lines describe the data of the triangle. The number of rows in the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.
Output
Your program is to write to standard output. The highest sum is written as an integer.
Sample Input
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
Sample Output
30
沿着↓或者↘ 走,找最路径最大的 输出
这个竟然是从最底下开始思考,因为 最底下的一行已经确认了到最低的了 就是他自己本身
倒数第二行 == max(sum(r+1,j) , sum(r+1,j+1)) + a[r][j]
#include <iostream>
using namespace std;
int a[101][101];
int sum[101][101];
int n;
// 递归
int getSum(int y,int x) {
if (y == n) {
return a[y][x];
}
int sum1 = getSum(y+1,x);
int sum2 = getSum(y+1,x+1);
return max(sum1,sum2) + a[y][x]; //我下面两种选择 选最好的 + 我本身
}
void print() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
}
int main() {
while(cin >> n) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
cin >> a[i][j];
}
}
// print();
// return 0;
cout << getSum(1,1) << endl;
}
}
#include <iostream>
using namespace std;
int a[101][101];
int sum[101][101];
int n;
// 递归
int getSum(int y,int x) {
if (y == n) {
return a[y][x];
}
int sum1 = getSum(y+1,x);
int sum2 = getSum(y+1,x+1);
return max(sum1,sum2) + a[y][x]; //我下面两种选择 选最好的 + 我本身
}
void print() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
}
int main() {
while(cin >> n) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
cin >> a[i][j];
}
}
//cout << "ok" << endl;
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= i; j++) {
if (i == n) {
sum[i][j] = a[i][j];
}else {
sum[i][j] = max(sum[i+1][j],sum[i+1][j+1]) + a[i][j];
}
}
}
cout << sum[1][1] << endl;
}
}