【NOIP2012PJ】【DP】摆花

$Link$

$luoguP1077$

$Description$

$Sample$ $Input$

2 4
3 2

$Sample$ $Output$

2

$Hint$

$Train$ $of$ $Thought$

DP
设$f_{i,j}$为前i种花种了j盆的方案数
$f_{i,j}=sum(f_{i-1,j-k})$
需要注意的是，$j$和$k$可能为0
记得%

$Code$

#include<cstdio>
#include<iostream> 

using namespace std;

int n, m, a[101], f[101][101];

int main() 
{
	f[0][0] = 1;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) 
	{
		scanf("%d", &a[i]);
		for (int j = 0; j <= m; j++)
			for (int k = 0; k <= a[i]; k++)
				if (j - k >= 0) f[i][j]  = (f[i - 1][j - k] + f[i][j]) % 1000007;
				else break;
	}
	printf("%d", f[n][m]);
	return 0;
}