dp[i][j]表示的状态是第i种花第j个位置,要注意的是j和k都是从0开始遍历的。k从0开始是因为上一层k只要<=就能往下进行,所以从下一种花的第0个位置开始加。
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 105;
const ll p = 1e6 + 7;
int a[N], dp[N][N];
int main()
{
int n, m; cin >> n >> m;
for (int i = 1; i <= n; i ++) cin >> a[i];
dp[0][0] = 1;
for (int i = 1; i <= n; i ++)
{
for (int j = 0; j <= m; j ++)
{
for (int k = 0; k <= a[i] && k <= j; k ++)
{
dp[i][j] = (dp[i][j] + dp[i - 1][j - k]) % p;
}
}
}
cout << dp[n][m];
return 0;
}