描述
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.
输入
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.
输出
Your program is to write to standard output. The highest sum is written as an integer.
样例输入
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
样例输出
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.
输入
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.
输出
Your program is to write to standard output. The highest sum is written as an integer.
样例输入
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
样例输出
30
1、递归实现:
#include<cstdio>
#include<algorithm>
#include<iostream>
#define MAX 101
//#define LOCAL
using namespace std;
int a[MAX][MAX];
int n;
int MaxSum(int i,int j){
if(i==n){
return a[i][j];
}
int x=MaxSum(i+1,j);
int y=MaxSum(i+1,j+1);
return max(x,y)+a[i][j];
}
int main(){
#ifdef LOCAL
freopen("in.txt","r",stdin);
#endif
int i,j;
scanf("%d",&n);
for(i=1;i<=n;i++){
for(j=1;j<=i;j++){
scanf("%d",&a[i][j]);
}
}
int maxss=MaxSum(1,1);
printf("%d\n",maxss);
return 0;
}
2、动态规划:
#include<stdio.h>
int a[105][105];
int main()
{
int i,j,n;
while(scanf("%d",&n)!=EOF)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
{
scanf("%d",&a[i][j]);
}
}
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
{
a[i][j]+=a[i-1][j-1]>a[i-1][j]?a[i-1][j-1]:a[i-1][j];
}
int max=0;
for(i=1;i<=n;i++)
if(a[n][i]>max)
max=a[n][i];
printf("%d\n",max);
}
return 0;
}