7



3 8



8 1 0



2 7 4



4 5 2 6 5



(图1)



图1给出了一个数字三角形。从三角形的顶部到底部有很多条不同的路径。对于每条路径，把路径上面的数加起来可以得到一个和，你的任务就是找到最大的和。



注意：路径上的每一步只能从一个数走到下一层上和它最近的左边的那个数或者右边的那个数。

-738,810,274,445,265 (Figure 1) Figure 1 shows a digital triangle. From the Department of the triangle at the top in the end there are many trails. For each path, the path above and get a few together, your task is to find the largest and. Note: Each step on the path can only come from a number of the next level and in its most recent number of the left or right that that number.