#include "molecules.h" #include <bits/stdc++.h> #define fi first #define se second using namespace std; vector<int> ans; vector<pair<int,int> > vec; void process(int j,int i){ for (int idx = j; idx <= i ; ++idx) ans.push_back(vec[idx].se); } std::vector<int> find_subset(int l, int u, std::vector<int> w) { vec.resize(w.size()); for (int i = 0; i < w.size(); ++i) { vec[i].fi=w[i]; vec[i].se=i; } sort(vec.begin(),vec.end()); if(vec[0].fi>=l&&vec[0].fi<=u){ process(0,0); return ans; } for (int i = 1; i < w.size(); ++i){ vec[i].fi+=vec[i-1].fi; if(vec[i].fi>=l&&vec[i].fi<=u){ process(0,i); return ans; } } for (int i = 0; i < w.size(); ++i) { for (int j = i+1; j < w.size(); ++j) { if((vec[j].fi-vec[i].fi)>=l&&(vec[j].fi-vec[i].fi)<=u){ process(i+1,j); return ans; } } /*if(w[i]>=l&&w[i]<=u){ process(0,i); return ans; } else if(w[i]>u){ auto search=lower_bound(w.begin(),w.begin()+i,w[i]-l); if(search==w.begin()+i) continue; if((w[i]-*search)>=l&&(w[i]-*search)<=u){ process((search-w.begin())+1,i); return ans; } }*/ } return vector<int>(0); }

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:14:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < w.size(); ++i)
                  ~~^~~~~~~~~~
molecules.cpp:24:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i < w.size(); ++i){
                  ~~^~~~~~~~~~
molecules.cpp:31:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < w.size(); ++i)
                  ~~^~~~~~~~~~
molecules.cpp:33:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = i+1; j < w.size(); ++j)
                     ~~^~~~~~~~~~