数字三角形

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.
给出一个数字三角形，你从[1,1]开始出发，走到最后一行。每次站在一个点上时，可以向下走，或者向右下走。将经过的数字加起来，希望其和最大。

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

赠送给那些刚接触dp的朋友，这道题如果是刚学dp一定觉得很难（但是我是个例外）。

认准一句话，这道题，每个点都只可能从上一层的相邻两个点转移过来，就是说它的状态只依赖于上一个状态，所以你只要取上面两个点中较大的加上就行了。

到最后一层统计出最大的，就是最终的答案

这道题要考虑边界

代码：

#include<bits/stdc++.h>
using namespace std;
int s[101][101],n,sum=0;
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    for(int j=1;j<=i;j++)
    cin>>s[i][j];
    for(int i=2;i<=n;i++)
    for(int j=1;j<=i;j++)
    {
        if(j==1)
        s[i][j]=s[i-1][j]+s[i][j];
        if(j==i)
        s[i][j]=s[i-1][j-1]+s[i][j];
        if(j!=1&&j!=i)
        s[i][j]=max(s[i-1][j],s[i-1][j-1])+s[i][j];
    }
    for(int i=1;i<=n;i++)
    if(s[n][i]>=sum)sum=s[n][i];
    cout<<sum;
}