#include<bits/stdc++.h> using namespace std; #include "molecules.h" typedef pair<int, int> ii; #define S second #define F first std::vector<int> find_subset(int p, int u, std::vector<int> w) { vector<ii> a; int n = w.size(); for(int i=0;i<n;i++) a.push_back(ii(w[i], i)); sort(a.begin(), a.end()); int su[n]; su[0] = a[0].F; for(int i=1;i<n;i++) su[i] = su[i-1] + a[i].F; //for(int i=0;i<n;i++) cout<<su[i]<<" "; //cout<<endl; for(int l=0;l<n;l++){ // -su[l-1] + su[r] >= p // su[r] >= su[l-1] + p int r; if(l==0) r = lower_bound(su+l, su+n, p) - su; else r = lower_bound(su+l, su+n, su[l-1] + p) - su; //cout<<l<<" "<<r<<" "<<su[r]<<" "<<su[l-1]<<" "<<endl; if(l!=0 && su[r]-su[l-1]>=p && su[r]-su[l-1]<=u || l==0 && su[r]>=p && su[r]<=u){ vector<int> ans; for(int i=l;i<=r;i++) ans.push_back(a[i].S); return ans; } } return vector<int>(); }

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:25:31: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   if(l!=0 && su[r]-su[l-1]>=p && su[r]-su[l-1]<=u || l==0 && su[r]>=p && su[r]<=u){
      ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~