1220 数字三角形

 1 #include<iostream>
 2 using namespace std;
 3 int main() 
 4 {
 5     int n,i,j,a[101][101];
 6     cin>>n;
 7     for (i=1; i<=n; i++)
 8         for (j=1; j<=i; j++)
 9             cin>>a[i][j];                             //输入数字三角形的值
10     for (i=n-1; i>=1; i--)
11         for (j=1; j<=i; j++) 
12         {
13             if (a[i+1][j]>=a[i+1][j+1])  
14             a[i][j]+=a[i+1][j];     //路径选择
15             else  a[i][j]+=a[i+1][j+1];
16         }
17     cout<<a[1][1]<<endl;
18 }