POJ 1015 Jury Compromise 2个月后重做，其实这是背包题目

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <assert.h>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;


#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
int n, m;
const int fix = 20;
const int maxn = 200 + 20;
struct node {
    int b, c, dis, sum;
}a[maxn];
const int up = 40 * 20 + 20;
struct DP {
    int is, pre;
    int id, val;
}dp[20 + 20][up];
set<int>ans;
bool in(int go, int val, int cmp) {
    while (go > 0) {
        if (dp[go][val].is == -1) return false;
        if (dp[go][val].id == cmp) return true;
        val = dp[go][val].pre;
        assert(val <= up);
        assert(val >= 0);
        go--;
    }
    return false;
}
void work() {
//    init();
    for (int i = 1; i <= n; ++i) {
        scanf("%d%d", &a[i].b, &a[i].c);
        a[i].dis = a[i].b - a[i].c + fix;
        a[i].sum = a[i].b + a[i].c;
    }
    memset(dp, -1, sizeof dp);
    dp[0][0].id = inf, dp[0][0].is = 0, dp[0][0].pre = inf, dp[0][0].val = 0;
    for (int i = 1; i <= m; ++i) { //选m个
        for (int j = 1; j <= n; ++j) {
            for (int k = a[j].dis; k <= up - 20; ++k) {
                if (dp[i - 1][k - a[j].dis].is == -1) continue;
                if (dp[i][k].val < dp[i - 1][k - a[j].dis].val + a[j].sum && !in(i - 1, k - a[j].dis, j)) {
//                    if (dp[i][k].id == j) continue;
                    dp[i][k].val = dp[i - 1][k - a[j].dis].val + a[j].sum;
                    dp[i][k].is = 0;
                    dp[i][k].id = j;
                    dp[i][k].pre = k - a[j].dis;
                }
            }
        }
    }
    int p1 = m * fix, p2 = m * fix;
    int id1 = -inf, id2 = -inf, idans = -inf;
    while (true) {
        if (dp[m][p1].is != -1) id1 = p1;
        if (dp[m][p2].is != -1) id2 = p2;
        if (id1 != -inf && id2 == -inf) {
            idans = id1;
            break;
        } else if (id1 == -inf && id2 != -inf) {
            idans = id2;
            break;
        } else if (id1 != -inf && id2 != -inf) {
            if (dp[m][id1].val > dp[m][id2].val) {
                idans = id1;
            } else idans = id2;
            break;
        }
        p1--;
        p2++;
    }
//    cout << idans << endl;
    ans.clear();
    int go = m;
    while (dp[go][idans].id != inf) {
        assert(dp[go][idans].is != -1);
        ans.insert(dp[go][idans].id);
        idans = dp[go][idans].pre;
        go--;
    }
    static int f = 0;
    printf("Jury #%d\n", ++f);
    int ans1 = 0, ans2 = 0;
    for (set<int> :: iterator it = ans.begin(); it != ans.end(); ++it) {
        ans1 += a[*it].b;
        ans2 += a[*it].c;
    }
//    cout << endl;
    printf("Best jury has value %d for prosecution and value %d for defence:\n", ans1, ans2);
    for (set<int> :: iterator it = ans.begin(); it != ans.end(); ++it) {
        cout << " " << *it;
    }
    cout << endl;
}

int main() {
#ifdef local
    freopen("data.txt", "r", stdin);
//    freopen("data.txt", "w", stdout);
#endif
    while (scanf("%d%d", &n, &m) != EOF && (n + m)) {
        work();
        printf("\n");
    }
    return 0;
}