题解和我的思路几乎一模一样,然而我的就是过不去……
是细节上出错了吗?
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const int maxn = 100, mod = 1000007;
int m, n;
int sum[maxn][maxn], a[maxn];
void dp()
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
for (int p = 0; p <= a[i]; p++)
{
if (j >= p)
sum[i][j] = (sum[i - 1][j - p] + sum[i][j]) % mod;
else break;
}
}
}
}
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 0; i <= n; i++)
sum[i][0] = 1;
dp();
cout << sum[n][m] % mod;
return 0;
}