ADV-229 合并石子 —— 区间dp引申（java）

import java.util.Scanner;

public class Main {
	static int[] stone;
	static int[][] dp;
	static int[] sum;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		stone = new int[n + 1];
		dp = new int[n + 1][n + 1];
		sum = new int[n + 1];
		for (int i = 1; i <= n; i++) {
			stone[i] = sc.nextInt();
			sum[i] = sum[i - 1] + stone[i];
			dp[i][i] = 0;
		}

     //区间dp
		for (int len = 1; len < n; len++) {
			for (int i = 1; i <= n-len; i++) {
				int j = i + len;
				dp[i][j] = Integer.MAX_VALUE;
				for (int k = i; k < j; k++) {
					dp[i][j] = Math.min(dp[i][j], dp[i][k] + dp[k + 1][j]);
				}
				dp[i][j] += sum[j] - sum[i - 1];
			}
		}
		System.out.println(dp[1][n]);
	}
}

备忘：日后详更思路。（最近真的时间不够用aaaa，forgive me.）