出现负数的01背包问题

把数位移一段值就可以了

POJ1837

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#define INF 0x3f3f3f3f
#define mod 1000000007
typedef long long LL;
using namespace std;

const int maxw = 15000 + 10;
const int maxn = 25;
int n, m;
int dp[maxn][maxw];
int dis[maxn], wei[maxn];

int main(int argc, const char * argv[]) {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &dis[i]);
    }
    for (int i = 1; i <= m; i++) {
        scanf("%d", &wei[i]);
    }
    dp[0][7500] = 1;
    for (int i = 1; i <= m; i++) {
        for (int j = 0; j <= 15000; j++) {
            for (int k = 1; k <= n; k++) {
                dp[i][j + dis[k] * wei[i]] += dp[i - 1][j];
            }
        }
    }
    printf("%d
", dp[m][7500]);
    return 0;
}

同样类型的还有POJ2184