fork download 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int getSmall(vector<int> &arr,int L,int R){
  4. 	int mini=1e9;
  5. 	int n=arr.size();
  6. 	for(int i=0;i<n;i++){
  7. 		unordered_map<int,int>mp;
  8. 		for(int j=i;j<n;j++){
  9. 			if(arr[j]>=L && arr[j]<=R){
  10. 				mp[arr[j]]=mp[arr[j]]+1;
  11. 			}
  12. 			if(mp.size()==abs(R-L+1)){
  13. 				int len=abs(j-i+1);
  14. 				mini=min(len,mini);
  15. 			}
  16.  
  17. 		}
  18. 	}
  19. 	if(mini==1e9){
  20. 		return -1;
  21. 	}
  22. 	return mini;
  23. }
  24.  
  25. int main() {
  26. 	// your code goes here
  27. 	int n;
  28. 	cin>>n;
  29. 	vector<int>v(n);
  30. 	for(int i=0;i<n;i++){
  31. 		cin>>v[i];
  32. 	}
  33. 	int L;
  34. 	cin>>L;
  35. 	int R;
  36. 	cin>>R;
  37. 	cout<<"Smallest subarray containing all the numbers from the range L to R is:"<<getSmall(v,L,R);
  38. 	return 0;
  39. }
Success #stdin #stdout 0s 5324KB
comments (?)
stdin 
5
5 2 4 3 1
2 
3
stdout 
Smallest subarray containing all the numbers from the range L to R is:3
https://ideone.com/sTQcMQ
language:
C++ (gcc 8.3)
created:
3 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!