不是吧（二进制拆分还是T,非前后缀）

#include <bits/stdc++.h>
using namespace std;
int n,q,w[10005],v[10005],s[10005],d,m,dp[10005],a,b,c,cnt,tot;
struct node{
	int l,r;
}zy[10005];
void col(){
	tot++;
	zy[tot].l = cnt+1;
	for (int i = 0;i <= 16;i++){
		int tmp = (1 << i);
		if (c <= tmp){
			cnt++;
			w[cnt] = c*a;
			v[cnt] = c*b;
			break;
		}else{
			cnt++;
			w[cnt] = tmp*a;
			v[cnt] = tmp*b;
			c -= tmp;
		}
	}
	zy[tot].r = cnt;
}
int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin >> n;
	for (int i = 1;i <= n;i++){
		cin >> a >> b >> c;
		col();
	}
	cin >> q;
	while (q--){
		cin >> d >> m;
		d++;
		int l = zy[d].l,r = zy[d].r;
		for (int i = 1;i <= cnt;i++){
			if (l <= i && i <= r) continue;
			for (int j = m;j >= w[i];j--)
				dp[j] = max(dp[j],dp[j-w[i]]+v[i]);
		}
		cout << dp[m] << "\n";
		memset(dp,0,sizeof(dp));
	}
	return 0;
}