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. void consistency(int n, int k) {
  27.     int sum = 0;
  28.     unordered_map<int,int> mp = {{0, -1}};
  29.     int maxLen = 0;
  30.  
  31.     for(int R=0; R<n; R++){
  32.         sum += a[R];
  33.         if(mp.count(sum-k)){
  34.             int L = mp[sum-k];
  35.             int len = R-L;
  36.             maxLen = max(maxLen, len);
  37.         }
  38.         if(!mp.count(sum)) mp[sum] = R;
  39.     }
  40.  
  41.     cout <<  maxLen << endl;
  42. }
  43.  
  44. void solve() {
  45.  
  46.     int n, k;
  47.     cin >> n >> k;
  48.     a.resize(n);
  49.     for(int i=0; i<n; i++) cin >> a[i];
  50.     consistency(n, k) ;
  51.  
  52. }
  53.  
  54.  
  55.  
  56.  
  57.  
  58. int32_t main() {
  59.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  60.  
  61.     int t = 1;
  62.     while (t--) {
  63.         solve();
  64.     }
  65.  
  66.     return 0;
  67. }
Success #stdin #stdout 0s 5312KB
comments (?)
stdin
copy 
6 15
10 5 2 7 1 -10
stdout
copy 
6
https://ideone.com/tuGw7z
language:
C++14 (gcc 8.3)
created:
11 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!