Problem Solving
boj 1932 : The Triangle
1ssrek
2016. 8. 10. 22:26
boj 1932 : The Triangle
전형적인 DP문제...
sum[i][j] = max(sum[i - 1][j - 1], sum[i - 1][j]) + a[i][j]