虽然NK题简单,但是dp还是要不断积累的,这道题主要就是这个递推关系式
令
d
p
[
i
]
[
j
]
dp[i][j]
dp[i][j]为使用前i个物品凑出j容量的组合数,
a
[
i
]
a[i]
a[i]是i号物品的体积,那么递推关系式为
d
p
[
i
]
[
j
]
=
d
p
[
i
−
1
]
[
j
]
+
d
p
[
i
−
1
]
[
j
−
a
[
i
]
]
dp[i][j]=dp[i-1][j]+dp[i-1][j-a[i]]
dp[i][j]=dp[i−1][j]+dp[i−1][j−a[i]]
#include<iostream>
#include<string>
#include<string.h>
#include<map>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
#define MAX 50
#define ll int
#define inf 0x3ffffffff
#define vec vector<ll>
//dp[i][j]:用前i个物品凑成容量j的组合数
ll dp[25][MAX];
int main() {
ll n;
while (cin >> n) {
vec a(n+1);
for (int i = 1; i <= n; i++)cin >> a[i];
for (int i = 1; i <= n; i++) {
dp[i - 1][0] = 1;
for (int j = a[i]; j <= 40; j++) {
//等于前i个物品凑成j的组合数,加上前i个物品凑成j-a[i]的组合数
dp[i][j] = dp[i - 1][j] + dp[i - 1][j - a[i]];
}
}
cout << dp[n][40] << endl;
}
}