AcWing 282. 石子合并(动态规划)

典型的分组dp问题，f[i][j]表示区间i到j的状态，然后在看题目。

题目

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;

class Main {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static PrintWriter pw = new PrintWriter(System.out);
    static int N = 310, n;
    static int f[][] = new int[N][N];
    static int nums[] = new int[N], sum[] = new int[N];

    public static void main(String[] args) throws IOException {
        String[] s = br.readLine().split(" ");
        n = Integer.parseInt(s[0]);
        s = br.readLine().split(" ");
        for (int i = 1; i <= n; i++) {
            nums[i] = Integer.parseInt(s[i - 1]);
            sum[i] += sum[i - 1] + nums[i];
        }

        for (int i = 2; i <= n; i++) {
            for (int j = 1; j + i - 1 <= n; j++) {
                int r = j + i - 1;
                f[j][r] = Integer.MAX_VALUE;
                for (int k = j; k <= j; k++)
                    f[j][r] = Math.min(f[j][r], f[j][k] + f[k + 1][r] + sum[r] - sum[j - 1]);
            }
        }
        pw.println(f[1][n]);
        pw.flush();
        pw.close();
        br.close();

    }
}