蓝桥杯练习系统ALGO-116
import java.util.Scanner;
public class ALGO_116pass {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
long[][] dp = new long[n + 1][k + 1];
int i, j, index;
for (i = 1; i <= n; i++) {
dp[i][0] = dp[i - 1][0] + in.nextInt();
}
for (j = 1; j <= k; j++) {
for (i = j + 1; i <= n; i++) {
for (index = 2; index <= i; index++) {
dp[i][j] = Math.max(dp[i][j], dp[index - 1][j - 1] * (dp[i][0] - dp[index - 1][0]));
}
}
}
System.out.println(dp[n][k]);
}
}