题目传送
题目:
思路:
动态转移方程为: dp[i][j] = dp[i][j] + dp[i-1][j-k]。
前i种花摆j盆花的摆法为:前i-1种花,摆j-k盆花的的摆法总数,另外k盆由第i种花摆出
还可以由记忆化搜索做出来,这里不贴代码了。
AC代码
#include <bits/stdc++.h>
inline int read(){char c = getchar();int x = 0,s = 1;
while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}
while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}
return x*s;}
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a,b) memset(a,b,sizeof(a))
#define lowbit(x) (x)&(-x)
const int N = 1e5 + 10;
const long long INFINF = 0x7f7f7f7f7f7f7f;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-7;
const unsigned long long mod = 998244353;
const double II = acos(-1);
const double PP = (II*1.0)/(180.00);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> piil;
int arr[105],dp[105][105];
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int n,m;
cin >> n >> m;
for(int i = 1;i <= n;i++) cin >> arr[i];
dp[0][0] = 1;
for(int i = 1;i <= n;i++)
for(int j = 0;j <= m;j++)
for(int k = 0;k <= min(j,arr[i]);k++)
dp[i][j] = (dp[i][j]+dp[i-1][j-k])%1000007;
cout << dp[n][m] << endl;
}