题目描述

blablabla

样例

blablabla

算法1

(暴力枚举) $O(n^2)$

blablabla

时间复杂度

C++ 代码

import java.io.*;
import java.util.Arrays;

class Main{
public static void main(String args[]) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
String [] s = br.readLine().split(” “);
int [] sum = new int [n+1];
for(int i=0;i<n;i++){
int arr = Integer.parseInt(s[i]);
sum[i+1] = sum[i]+arr;
}

    int [][] dp = new int [n+1][n+1];
    for(int len=2;len<=n;len++){
        for(int i=1;i+len-1<=n;i++){
            int l=i;
            int r = l+len-1;
            dp[l][r] = Integer.MAX_VALUE-100;
            for(int k =l ; k<r ; k++){
                dp[l][r] = Math.min( dp[l][r] , dp[l][k]+dp[k+1][r]+sum[r]-sum[l-1]);
            }
        }
    }
    System.out.println(dp[1][n]);
}

}