看题解的时候发现背包二进制优化的解法把空间也乘了一个 $\log n$，感觉没有必要，下面是我的写法，可供参考：

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int f[maxn][maxn], g[maxn][maxn], V = 1000, n, a[maxn], b[maxn], c[maxn], q, d, e;

void init(int f[][maxn], int i, int p) {
    for (int j = 0; j <= V; j++) f[i][j] = f[p][j];
}

void pack_01(int f[][maxn], int i, int a, int b) {
    for (int j = V; j >= a; j--) f[i][j] = max(f[i][j], f[i][j-a]+b);
}

void pack_comp(int f[][maxn], int i, int a, int b) {
    for (int j = a; j <= V; j++) f[i][j] = max(f[i][j], f[i][j-a]+b);
}

void pack(int f[][maxn], int i, int a, int b, int c) {
    if (a * c >= V) pack_comp(f, i, a, b);
    else {
        for (int j = 1; j <= c; c -= j, j *= 2)
            pack_01(f, i, a*j, b*j);
        if (c) pack_01(f, i, a*c, b*c);
    }
}

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i] >> b[i] >> c[i];
    for (int i = 1; i <= n; i++) {
        init(f, i, i-1);
        pack(f, i, a[i], b[i], c[i]);
    }
    for (int i = n; i >= 1; i--) {
        init(g, i, i+1);
        pack(g, i, a[i], b[i], c[i]);
    }
    cin >> q;
    while (q--) {
        cin >> d >> e;
        d++;
        int ans = 0;
        for (int i = 0; i <= e; i++) ans = max(ans, f[d-1][i] + g[d+1][e-i]);
        cout << ans << endl;
    }
    return 0;
}