# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984177 | alphagomaster | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n,u;
int l;
cin >> n >> l >> u;
pair<int,int> w[n];
for(int i = 0 ; i < n;i++){
cin >> w[i].first;
w[i].second=i;
}
sort(w,w+n);
int j = 0;
int sum = 0;
deque<int>v;
for(int i = 0; i < n;i++){
v.push_back(w[i].second);
sum += w[i].first;
while(sum > u){
sum -= w[j].first;
j ++;
v.pop_front();
}
if(sum >= l && sum <= u){
cout << i-j+1 << endl;
for(int jj = 0; jj <size(v);jj++){
cout << v[jj]<<" ";
}
cout << endl;
return 0;
}
}
cout << 0 << endl;
return 0;
}