HDU2084 数塔(DP)
原题地址:http://acm.hdu.edu.cn/showproblem.php?pid=2084
题意
中文自己看
思路
一道经典DP题型,基本思路是从下自上的进行选取最大的数。
例如从n-1行开始,判断每一个数的左右孩子哪一个大就和哪一个相加。
AC代码
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
/**
* Created with IntelliJ IDEA.
*
* @author wanyu
* @Date: 2018-02-20
* @Time: 21:53
* To change this template use File | Settings | File Templates.
* @desc
*/
public class Main {
public static void main(String[] args) throws IOException {
StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
in.nextToken();
int T = (int) in.nval;
for (int i = 0; i < T; i++) {
in.nextToken();
int n = (int) in.nval;
int[][] nums = new int[n + 1][n + 1];
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= j; k++) {
in.nextToken();
nums[j][k] = (int) in.nval;
}
}
for (int j = n - 1; j >= 1; j--) {
for (int k = 1; k <= j; k++) {
nums[j][k] = nums[j][k] + Math.max(nums[j + 1][k], nums[j + 1][k + 1]);
}
}
System.out.println(nums[1][1]);
}
}
}