蓝桥杯算法提高VIP-摆花

解题思路:

注意事项:

参考代码:

Scanner scanner =new Scanner(System.in);

int n=scanner.nextInt();//种类

int m=scanner.nextInt();//盆数

int dp[][]=new int[n+1][m+1];

int w[]=new int [n+1];

for (int i = 1; i <w.length; i++) {

w[i]=scanner.nextInt();

}

for(int j = 1; j <=m; j++) {    

    if(j<=w[1]) {

        dp[1][j] = 1;

    }

}

for(int i = 1; i < n+1; i++) {   

    dp[i][0] = 1;

}

for (int i = 2;i <=n; i++) {

for (int j = 1; j <=m; j++) {

for (int k = 0; k <= w[i]; k++) {

if (j>=k) {

dp[i][j]=dp[i][j]+dp[i-1][j-k];

dp[i][j]=dp[i][j]%1000007;

}

}

}

}

System.out.println(dp[n][m]);