P1077 [NOIP2012 普及组] 摆花

//#define local
#include<cstdio>
#include<iostream>
using namespace std;
typedef long long ll;
int n,m;
int a[105],sum[105]={0}; 
ll f[105][105]={0};
const ll mod=1e6+7; 
int main(){
#ifdef local
freopen("data.in","rb",stdin);
//freopen("data.out","wb",stdout);
#endif
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i){
	scanf("%d",&a[i]);
	sum[i]=sum[i-1]+a[i];
}
f[0][0]=1;
for(int i=1;i<=n;++i){
	for(int j=0;j<=min(sum[i],m);++j){
		for(int k=0;k<=min(a[i],j);++k){
			f[i][j]=(f[i][j]+f[i-1][j-k])%mod;
		}
	}
}
printf("%lld",f[n][m]);
return 0;
}