The Triangle

The Triangle
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 61504 Accepted: 36828
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
描述

7
3 8
8 1 0
2 7 4 4
4 5 2 6 5

（图1）
图1显示了一个数字三角形。 编写一个程序，计算从顶部开始到底部某处的路径上传递的最大数字总和。 每个步骤可以沿对角线向下滑动，也可以沿斜向下滑动到右侧。
输入

您的程序是从标准输入读取。 第一行包含一个整数N：三角形中的行数。 以下N行描述了三角形的数据。 三角形中的行数> 1但<= 100.三角形中的数字全部为整数，介于0到99之间。
产量

你的程序是写入标准输出。 最高总和写为整数。

#include
#include
using namespace std;
int main()
{
int a[100][100];
int i,j,n;
cin>>n;
for(i=0;i<n;i++)
for(j=0;j<=i;j++){
cin>>a[i][j];
}
for(i=n-2;i>=0;i–){
for(j=0;j<=i;j++){
a[i][j]=a[i][j]+max(a[i+1][j],a[i+1][j+1]);
}
}
cout<<a[0][0]<<endl;
}