摘要:
二进制分组优化多重背包 index = 0; for (int i = 1; i <= m; i++) { int c = 1, p, h, k; cin >> p >> h >> k; while (k > c) { k -= c; list[++index].w = c * p; list[in 阅读全文
摘要:
可并堆 #include <bits/stdc++.h> using namespace std; #define ll long long #define pii pair<int, int> #define mp make_pair #define db double const int max 阅读全文