fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27. // 4
  28. // 2
  29. // 0 1
  30. // 3
  31. // 0 1 0
  32. // 9
  33. // 0 1 1 1 1 1 0 0 0
  34. // 8
  35. // 0 0 1 0 0 0 1 1
  36.  
  37.  
  38.  
  39.  
  40. vector<int> a;
  41.  
  42. int consistency(int n) {
  43.  
  44. 	int ones = 0;
  45. 	int zeroes = 0;
  46.  
  47. 	unordered_map<int, int> mp = {{0, -1}};
  48.  
  49. 	int ans = 0;
  50.  
  51. 	for(int i=0; i<n; i++){
  52. 		if(a[i] == 0) zeroes++;
  53. 		else ones++;
  54.  
  55. 		int dif = zeroes - ones;
  56.  
  57. 		if(mp.count(dif)){
  58. 			int l = mp[dif];
  59. 			int len = i-l;
  60. 			ans = max(ans, len);
  61. 		}
  62. 		else mp[dif] = i;
  63.  
  64. 	}
  65.  
  66. 	return ans;
  67. }
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77. int practice(int n){
  78.  
  79.  
  80.     return 0;
  81. }
  82.  
  83.  
  84.  
  85.  
  86.  
  87. void solve() {
  88.  
  89.     int n;
  90.     cin>> n;
  91.  
  92.     a.resize(n);
  93.     for(int i=0; i<n; i++) cin >> a[i];
  94.  
  95.     cout << consistency(n) << endl;
  96.  
  97.  
  98. }
  99.  
  100.  
  101.  
  102.  
  103.  
  104. int32_t main() {
  105.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  106.  
  107.     int t = 1;
  108.     cin >> t;
  109.     while (t--) {
  110.         solve();
  111.     }
  112.  
  113.     return 0;
  114. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
4
2
0 1
3
0 1 0
9
0 1 1 1 1 1 0 0 0
8
0 0 1 0 0 0 1 1
stdout
copy 
2
2
6
6
https://ideone.com/7SwcNk
language:
C++14 (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!