https://www.luogu.com.cn/problem/P1077
思路:
d
p
[
i
]
dp[i]
dp[i]表示摆上
i
i
i盆花时的方案数,假设当前位置为
i
i
i,如果要摆上
j
j
j盆第
k
k
k种花,那么有:
d
p
[
i
]
+
=
d
p
[
i
−
j
]
dp[i]+=dp[i-j]
dp[i]+=dp[i−j]其中
1
<
=
i
<
=
m
,
1
<
=
j
<
=
a
k
1<=i<=m,1<=j<=a_k
1<=i<=m,1<=j<=ak。
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define pr pair<int,int>
using namespace std;
typedef long long ll;
const int mod=1000007;
int n,m;
int dp[105];
int main()
{
scanf("%d%d",&n,&m);
int v;
dp[0]=1;
while(n--)
{
scanf("%d",&v);
for(int i=m;i>=1;i--)
for(int j=min(i,v);j>=1;j--)
dp[i]=(dp[i]+dp[i-j])%mod;
}
printf("%d\n",dp[m]);
return 0;
}