# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
317274 | 2020-10-29T09:08:45 Z | analyticalprogrammer | Detecting Molecules (IOI16_molecules) | C | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; int find_subset(int l, int u, int[] w, int n, int[] result){ int start = 0; for(int end =0 ;end<n;end++){ queue<int> subset; int cursum = 0; for(int i =start;i<end-start+1;i++){ cursum+=w[i]; subset.push(w[i]); } if(cursum>=l &&<=u){ break; } else if(cursum>u){ subset.pop(); start++; } } int index= 0 ; for(auto i =subset.front(); i != subset.back(); i++) { result[index] = i; index++; } return result; }