fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. inline int power(int a, int b) {
  6.     int x = 1;
  7.     while (b) {
  8.         if (b & 1) x *= a;
  9.         a *= a;
  10.         b >>= 1;
  11.     }
  12.     return x;
  13. }
  14.  
  15.  
  16. const int M = 1000000007;
  17. const int N = 3e5+9;
  18. const int INF = 2e9+1;
  19. const int LINF = 2000000000000000001;
  20.  
  21. //_ ***************************** START Below *******************************
  22.  
  23.  
  24.  
  25. vector<int> a;
  26. int consistency1(int n) {
  27.  
  28. 	unordered_map<int,int> mp;
  29. 	int s = 0, e = 0;
  30. 	int ans = 0;
  31.  
  32. 	while(e<n){
  33. 		mp[a[e]]++;
  34.  
  35. 		while(s<=e && mp.size() < e-s+1 ){
  36. 			mp[a[s]]--;
  37. 			if(mp[a[s]] == 0) mp.erase(a[s]);
  38. 			s++;
  39. 		}
  40.  
  41. 		int len = e-s+1;
  42. 		ans = max(ans, len);
  43.  
  44. 		e++;
  45. 	}
  46.  
  47. 	return ans;
  48.  
  49. }
  50.  
  51.  
  52. int consistency2(int n) {
  53.  
  54. 	unordered_map<int,int> mp;
  55. 	int s = 0, e = 0;
  56. 	int ans = 0;
  57.  
  58. 	while(e<n){
  59. 		mp[a[e]]++;
  60.  
  61. 		if(mp.size() == e-s+1){
  62. 			ans = max(ans, e-s+1);
  63. 			e++;
  64. 		}
  65. 		else{
  66. 			while(s<=e && mp.size() < e-s+1 ){
  67. 				mp[a[s]]--;
  68. 				if(mp[a[s]] == 0) mp.erase(a[s]);
  69. 				s++;
  70. 			}
  71. 			int len = e-s+1;
  72. 			ans = max(ans, len);
  73.  
  74. 			e++;
  75. 		}
  76. 	}
  77.  
  78. 	return ans;
  79.  
  80. }
  81.  
  82.  
  83. //? Last Occurence Sliding window 
  84.  
  85. //* We are trying to maintain a window of unique elements only
  86. //* 	[ a  p  k  e  b  c  e]
  87. //*  So assuming [ a  p  k  e  b  c  ]  are distinct elements in window
  88. //*  If a[e] disturbs unqiueness => shrink window i.e  s = lastPos(a[e]) + 1 
  89. //* 	a  p  k  e  [ b  c  e ]  
  90.  
  91.  
  92. //* 	e  [ a  b  c  e]
  93. //*  If a[e] disturbs unqiueness => shrink   s = max(s , lastPos(a[e]) + 1 ) == s
  94.  
  95.  
  96. int consistency3(int n) {
  97.  
  98. 	int ans = 0;
  99. 	int s = 0, e=0;
  100.  
  101. 	//*  ele => last index
  102. 	unordered_map<int,int> mp;
  103.  
  104. 	while(e<n){
  105.  
  106. 		if(mp.count(a[e])){
  107. 			int last = mp[a[e]];
  108.  
  109. 			while(s<=last){
  110. 				mp.erase(a[s]);
  111. 				s++;
  112. 			}		
  113. 			s = last+1;
  114.  
  115. 			ans = max(ans, e-s+1);
  116. 			e++;
  117. 		}
  118. 		else{
  119. 			ans = max(ans, e-s+1);
  120. 			mp[a[e]] = e;
  121. 			e++;
  122. 		}
  123. 	}
  124.  
  125. 	return ans;
  126.  
  127. }
  128.  
  129.  
  130.  
  131.  
  132.  
  133.  
  134.  
  135.  
  136.  
  137.  
  138.  
  139.  
  140. int practice(int n) {
  141.  
  142. 	return 0;	
  143. }
  144.  
  145.  
  146. void solve() {
  147.  
  148. 	int n;
  149. 	cin >> n;
  150.  
  151. 	a.resize(n);
  152. 	for(int i=0; i<n; i++) cin >> a[i];
  153.  
  154.     cout << consistency1(n) << " " <<  consistency2(n) << " " << consistency3(n) << endl;
  155.     // cout << consistency1(n) << " -> " << practice(n) << endl;
  156.  
  157. }
  158.  
  159.  
  160.  
  161.  
  162.  
  163. int32_t main() {
  164.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  165.  
  166.     int t = 1;
  167.     // cin >> t;
  168.     while (t--) {
  169.         solve();
  170.     }
  171.  
  172.     return 0;
  173. }
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
10
3 4 2 5 2 6 7 8 9 10
stdout
copy 
7 7 7
https://ideone.com/9aWoiU
language:
C++14 (gcc 8.3)
created:
19 hours 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!