Reprint please indicate the source CSDN ametake All rights reserved
Title Description Description
The number triangle must pass a certain point to make it go the distance and the maximum
Enter a description input
Description
Row 1th N, representing n rows
2nd to n+1 behavior each weight value
The program must go through the N Div 2,n Div 2 point
Outputs description output
Description
Maximum Value
Sample input to
sample
2
1
1 1
Sample output sample
outputs
2
Data
size & Hint
N <=25
Listen to Lu Jinglong god Ben today to understand this problem how to do the original only need to specify the points must pass a maximum value, so as to ensure that after this point, minus this point can be
Digital triangles ww and www are all so the code is out of the difference just WW is making N/2,N/2 this point while www is input this point
Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.
"Basic exercise" "Checkerboard DP" codevs2193 Digital triangle WW