fork download
copy 
  1. #include <iostream>
  2. using namespace std;
  3. #include<vector>
  4. #include <bits/stdc++.h>
  5.  
  6. int main() {
  7. 	// your code goes here
  8. 	vector<int>arr={3,2,4,5,2,6,7,8,9,10};
  9. 	int n=arr.size();
  10.  
  11. 	int i=0,j=0;
  12. 	int current_length=0,max_length=0;
  13. 	unordered_map<int,int>mp;
  14. 	int d=0;
  15. 	int k=n/2;
  16. 	while(i<n && j<n)
  17. 	 {
  18.  
  19. 	    if(mp.find(arr[j])==mp.end())
  20. 	     {
  21. 	     	mp[arr[j]]=j;
  22. 	     	current_length=(j-i+1);
  23. 	     	max_length=max(current_length,max_length);
  24.  
  25. 	     }
  26. 	     else
  27. 	      {
  28. 	      	int previous_occurence=mp[arr[j]];
  29. 	      	while(i<=previous_occurence)
  30. 	      	 {
  31. 	      	 	mp.erase(arr[i]);
  32. 	      	 	i++;
  33. 	      	 }
  34. 	      	 i=previous_occurence+1;
  35. 	      	 mp[arr[j]]=j;
  36.  
  37. 	      }
  38.  
  39. 	 	 j++;
  40.  
  41. 	 }
  42.  
  43. 	 cout<<max_length;
  44.  
  45. 	return 0;
  46.  
  47. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
8
https://ideone.com/zoWicJ
language:
C++ (gcc 8.3)
created:
1 day 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!