fork(1) download
  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.  
  28. // 6 15
  29. // 10 5 2 7 1 -10
  30.  
  31.  
  32.  
  33. vector<int> a;
  34.  
  35. int consistency(int n, int k) {
  36. int sum = 0;
  37. unordered_map<int,int> mp = {{0, -1}};
  38. int maxLen = 0;
  39.  
  40. for(int R=0; R<n; R++){
  41. sum += a[R];
  42. if(mp.count(sum-k)){
  43. int L = mp[sum-k];
  44. int len = R-L;
  45. maxLen = max(maxLen, len);
  46. }
  47. if(!mp.count(sum)) mp[sum] = R;
  48. }
  49.  
  50. return maxLen;
  51. }
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67. int practice(int n, int k){
  68.  
  69.  
  70. return 0;
  71. }
  72.  
  73.  
  74.  
  75.  
  76.  
  77. void solve() {
  78.  
  79. int n, k;
  80. cin >> n >> k;
  81.  
  82. a.resize(n);
  83. for(int i=0; i<n; i++) cin >> a[i];
  84.  
  85. cout << consistency(n, k) << endl ;
  86.  
  87. }
  88.  
  89.  
  90.  
  91.  
  92.  
  93.  
  94. int32_t main() {
  95. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  96.  
  97. int t = 1;
  98. // cin >> t;
  99. while (t--) {
  100. solve();
  101. }
  102.  
  103. return 0;
  104. }
Success #stdin #stdout 0s 5320KB
stdin
6 15
10 5 2 7 1 -10
stdout
6