0808 poj#1163 The Triangle

摘要

-使用动态规划的思想，避免不必要重复计算。

原题目摘要

- POJ - 1163

The Triangle

---

-

 

 

    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

---

题目理解

-题目描述的从根出发 但这样出发并不能找到问题的子结构。以最后一行出发的话就可以发现子结构。可用递归可用递推。

注意

-动态规划的进行的方向 不应该是状态增加的方向，进行的方向要能达到边界。

题目中的数据只用一次的可以在计算后重新保存其他的值，达到内存的合理利用。

日期

-2017 0808

附加

-

代码

1

#include <cstdio>

2

#include <algorithm>

3

#include <iostream>

4

#include <memory>

5

using namespace std;

6

#define MAX 101

7

int D[MAX][MAX];

8

9

10

11

int main(){

12

13

    int r;

14

    scanf("%d",&r);r+=1;

15

    for(int i=0;i<r;i++){

16

        for(int j=0;j<i;j++){

17

            scanf("%d",&D[i][j]);

18

        }

19

    }

20

21

22

    for(int i=r-2;i>0;i--){

23

        for(int j=0;j<i;j++){

24

            D[i][j]=max(D[i+1][j],D[i+1][j+1])+D[i][j];

25

        }

26

    }

27

    printf("%d",D[1][0]);

28

    return 0;

29

}