蓝桥杯——最大的算式

package ONE;

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int k = scanner.nextInt();
		int[] num = new int[n];
		for(int i=0;i<n;i++){
			num[i] = scanner.nextInt();
		}
		long max=max(num, 0, num.length, k);
		
		System.out.println(max);
	}

	
	private static int getsum(int[] num,int start,int end) {
		int sum=0;
		for(int i=start;i<end;i++){
			sum+=num[i];
		}
		return sum;
	}
	
	private static long maxvalue(long a,long b) {
		if (a>b) {
			return a;
		}else {
			return b;
		}
	}
	
	private static long max(int[] num,int start,int len,int mul_x) {
		if (mul_x==0) {
			return getsum(num,start,start+len);
		}
		long max=0;
		long[] tmp = new long[255];
		int local = start;
		for(;local-start<len-1;local++){
			tmp[local] = getsum(num, start, local+1)*max(num, local+1, len-1+start-local, mul_x-1);
			max = maxvalue(max, tmp[local]);
		}
		return max;
	}
}