fork download
copy 
  1. #include <iostream>
  2. using namespace std;
  3. #include <bits/stdc++.h>
  4. #include<vector>
  5. int main() {
  6. 	// your code goes here
  7. 	vector<int>nums={9,10,1,2,3,4};
  8. 	int n=nums.size();
  9. 	unordered_map<int,int>prefix,suffix;
  10. 	for(int i=0;i<n;i++)
  11. 	 {
  12. 	    suffix[nums[i]]++;
  13.  
  14. 	 }
  15. 	 int flag=0;
  16. 	for(int i=2;i<=n-1;i++)
  17. 	 {
  18. 	 	 suffix[nums[i]]--;
  19. 	 	if(prefix.find(nums[i]-1)!=prefix.end() && suffix.find(nums[i]+1)!=suffix.end())
  20. 	 	  {
  21. 	 	  	flag=1;
  22. 	 	  	cout<<"true";
  23. 	 	  	break;
  24. 	 	  }
  25. 	 	  prefix[nums[i]]++;
  26. 	 }
  27. 	 if(flag==0)
  28. 	  cout<<"false";
  29.  
  30. 	return 0;
  31. }
Success #stdin #stdout 0.01s 5284KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
true
https://ideone.com/FyePl6
language:
C++ (gcc 8.3)
created:
7 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!