#include <bits/stdc++.h> using namespace std; #ifndef wambule #include "molecules.h" #endif vector<int> find_subset(int l, int u, vector<int> w) { vector<int> dr; int n = w.size(); multiset<int> s; long long sm = 0; int fl = -1, fr; for(int i = n - 1; i >= 0; --i) { sm += w[i]; if(sm >= l) { if(sm <= u) { fl = 0; fr = sm; } break; } s.insert(sm); } sm = 0; for(int i = 0; i < n; ++i) { if(i + (int)s.size() == n) s.erase(--s.end()); sm += w[i]; if(sm >= l) { if(sm <= u) { fl = sm; fr = 0; } break; } auto it = s.lower_bound(l - sm); if(it != s.end() && sm + *it <= u) { fl = sm; fr = *it; break; } } if(fl != -1) { sm = 0; for(int i = 0; i < n; ++i) { sm += w[i]; if(sm > fl) break; dr.push_back(i); } sm = 0; for(int i = n - 1; i >= 0; --i) { sm += w[i]; if(sm > fr) break; dr.push_back(i); } } assert((int)dr.size() <= n && (dr.size() || fl == -1)); return dr; } #ifdef wambule int main() { ios::sync_with_stdio(0); cin.tie(0); return 0; } #endif