算法第三章实践报告

 1 #include <iostream>
 2 using namespace std;
 3 
 4 int main() {
 5     int n;
 6     cin >> n;
 7     int a[n][n];
 8     int m[n][n];
 9     for(int i = 0; i < n; i++) {
10         for(int j = 0; j <= i; j++) {
11             cin >> a[i][j];
12         }
13     }
14     for(int j = 0; j < n; j++) {
15         m[n-1][j] = a[n-1][j];
16     }
17     for(int i = n - 2; i >= 0; i--){
18         for(int j = 0; j <= i; j++) {
19             if(m[i+1][j]>m[i+1][j+1]){
20                 m[i][j] = m[i+1][j] + a[i][j];
21             } else {
22                 m[i][j] = m[i+1][j+1] + a[i][j];
23             }
24         }
25     }
26     cout << m[0][0];
27     
28 }