达达帮翰翰给女生送礼物,翰翰一共准备了 N 个礼物,其中第 i 个礼物的重量是 G[i]。
达达的力气很大,他一次可以搬动重量之和不超过 W 的任意多个物品。
达达希望一次搬掉尽量重的一些物品,请你告诉达达在他的力气范围内一次性能搬动的最大重量是多少。
输入格式
第一行两个整数,分别代表 W 和 N。
以后 N 行,每行一个正整数表示 G[i]。
输出格式
仅一个整数,表示达达在他的力气范围内一次性能搬动的最大重量。
数据范围
1≤N≤46
1≤W,G[i]≤231−1
输入样例:
20 5
7
5
4
18
1
输出样例:
19
折半搜索法,直接爆搜是n^46次方必超时,折半是n^23 + n^23不会超时
#include<bits/stdc++.h>
using namespace std; using ll = long long;
int dir[4][2] = { 1, 0, -1, 0, 0, 1, 0, -1 };
//using lll = __int128; template <class T> istream& read(T& x, istream& cin = std::cin) { T num = 0; bool f = 0; char ch = 0; while (!isdigit(ch)) { f |= ch == '-'; if (!cin.get(ch)) return cin; }while (isdigit(ch)) { num = (num << 3) + (num << 1) + (ch ^ 48); if (!cin.get(ch)) break; }x = f ? -num : num; return cin; }template <class T> ostream& write(T x, ostream& cout = std::cout) { if (x < 0) cout.put('-'), x = -x; if (x > 9) write(x / 10); cout.put(x % 10 + '0'); return cout; }ostream& operator<<(ostream& cout, lll x) { write(x); return cout; }istream& operator>>(istream& cin, lll& x) { return read(x); }bool check(int i, int j);
bool check(int i, int j);
const int N = 1e6 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f;
int n, m, g[N], ans, cnt;
int s[1 << 25];
void init() {
cin >> m >> n;
for (int i = 0; i < n; i++)
cin >> g[i];
sort(g, g + n, greater<int>());
return;
}
inline void input(int& x) {
s[cnt++] = x;
return;
}
inline void maxsum(int& x) {
int l = 0, r = cnt - 1;
while (l < r) {
int mid = l + r + 1 >> 1;
if (s[mid] > m - x) r = mid - 1;
else l = mid;
}
ans = max(ans, x + s[l]);
return;
}
void dfs(int l, int r, int sum, void (*calc)(int&)) {
if (sum > m) return;
if (l >= r) {
calc(sum);
return;
}
dfs(l + 1, r, sum, calc);
if ((ll)sum + g[l] > m) return;
dfs(l + 1, r, sum + g[l], calc);
}
void solve() {
dfs(0, n / 2 + 2, 0, input);
sort(s, s + cnt);
cnt = (unique(s, s + cnt) - s);
dfs(n / 2 + 2, n, 0, maxsum);
cout << ans;
return;
}
int main(void) {
ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(6) << fixed;
int TT = 1;
//cin >> TT;
for (int ii = 1; ii <= TT; init(), solve(), ii++, cout << "\n") {}
return 0;
}
使用stl
//https://www.acwing.com/problem/content/description/173/
#include<bits/stdc++.h>
using namespace std; using ll = long long;
int dir[4][2] = { 1, 0, -1, 0, 0, 1, 0, -1 };
//using lll = __int128; template <class T> istream& read(T& x, istream& cin = std::cin) { T num = 0; bool f = 0; char ch = 0; while (!isdigit(ch)) { f |= ch == '-'; if (!cin.get(ch)) return cin; }while (isdigit(ch)) { num = (num << 3) + (num << 1) + (ch ^ 48); if (!cin.get(ch)) break; }x = f ? -num : num; return cin; }template <class T> ostream& write(T x, ostream& cout = std::cout) { if (x < 0) cout.put('-'), x = -x; if (x > 9) write(x / 10); cout.put(x % 10 + '0'); return cout; }ostream& operator<<(ostream& cout, lll x) { write(x); return cout; }istream& operator>>(istream& cin, lll& x) { return read(x); }bool check(int i, int j);
bool check(int i, int j);
const int N = 1e6 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f;
int n, m, g[N], ans;
vector<int> s;
void init() {
s.reserve(1 << 25);
cin >> m >> n;
for (int i = 0; i < n; i++)
cin >> g[i];
sort(g, g + n, greater<int>());
return;
}
inline void input(int& x) {
s.emplace_back(x);
return;
}
inline void maxsum(int& x) {
ans = max(ans, x + *(-- upper_bound(s.begin(), s.end(), m - x)));
return;
}
void dfs(int l, int r, int sum, void (*calc)(int&)) {
if (sum > m) return;
if (l >= r) {
calc(sum);
return;
}
dfs(l + 1, r, sum, calc);
if ((ll)sum + g[l] > m) return;
dfs(l + 1, r, sum + g[l], calc);
}
void solve() {
dfs(0, n / 2 + 2, 0, input);
sort(s.begin(), s.end());
s.erase(unique(s.begin(), s.end()), s.end());
dfs(n / 2 + 2, n, 0, maxsum);
cout << ans;
return;
}
int main(void) {
ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(6) << fixed;
int TT = 1;
//cin >> TT;
for (int ii = 1; ii <= TT; init(), solve(), ii++, cout << "\n") {}
return 0;
}