蓝桥杯 最大的算式 动态规划和递归两种方法

import java.util.*;

public class Main{

    public static void main(String[] args) {
        Scanner is=new Scanner(System.in);
        while(is.hasNextInt()) {
            int n=is.nextInt();
            int k=is.nextInt();
            int[] a=new int[n];
            for(int i=0;i<n;i++)
                a[i]=is.nextInt();
            System.out.println(f1(a,0,a.length-1,k));
            System.out.println(f2(a,k));
        }
        is.close();
    }
    
    private static long f2(int[] arr,int k) {
        long[][] dp=new long[arr.length+1][k+1];
        //dp[i][j]表示前i个数中间有j个乘号时的解
        for(int i=1;i<=arr.length;i++)
            dp[i][0]=sum(arr,0,i-1);
        for(int i=2;i<=arr.length;i++) {
            for(int j=1;j<=k&&j<i;j++) {
                for(int l=1;l<i;l++)
                    dp[i][j]=dp[i][j]<(dp[l][j-1]*sum(arr,l,i-1))?
                                (dp[l][j-1]*sum(arr,l,i-1)):dp[i][j];
            }
        }
     　　return dp[arr.length][k];
    }
    
    private static long f1(int[] arr,int st,int ed,int k) {
        if(k==0) return sum(arr,st,ed);
        long max=0;
        for(int i=st;i<ed;i++) {
            long a=sum(arr,st,i)*f1(arr,i+1,ed,k-1);
            max=max<a?a:max;
        }
        return max;
    }
    private static int sum(int[] arr,int st,int ed) {
        int sum=0;
        for(int i=st;i<=ed;i++)
            sum+=arr[i];
        return sum;
    }
}

 

转载于:https://www.cnblogs.com/lshao/p/8620059.html