描述
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
代码:
简单的动态规划,注意只能往右,往下就行了。
#include<stdio.h>
#include<iostream>
using namespace std;
int dp[110][110];
int main()
{
int n,i,j;
int a[110][110];
while(~scanf("%d",&n))
{
for(i=0;i<n;i++)
for(j=0;j<=i;j++)
scanf("%d",&a[i][j]);
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
{
dp[i][j]=max(dp[i-1][j]+a[i-1][j-1],dp[i-1][j-1]+a[i-1][j-1]);
}
int max;
max=dp[n][1];
for(i=1;i<n;i++)
{
if(dp[n][i]>max)
max=dp[n][i];
}
printf("%d\n",max);
}
return 0;
}
优化代码:
#include<iostream>
#include<algorithm>
using namespace std;
int a[101][101],n;
int *maxsum;
int main()
{
int i,j;
while(cin>>n)
{
for(i=1; i<=n; i++)
for(j=1; j<=i; j++)
cin>>a[i][j];
maxsum=a[n];//指向第n行
for(i=n-1; i>=1; i--)
for(j=1; j<=i; j++)
maxsum[j]=max(maxsum[j],maxsum[j+1])+a[i][j];
cout<<maxsum[1]<<endl;
}
return 0;
}