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.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. int consistency(int n, int k){
  33.  
  34. 	int sum = 0;
  35. 	unordered_map<int,int> mp;
  36.  
  37. 	int ans = 0;
  38.  
  39. 	for(int i=0; i<n; i++){
  40. 		int x = a[i];
  41. 		sum += x;
  42.  
  43. 		int dif1 = x + k;
  44. 		int dif2 = x - k;
  45.  
  46. 		if(mp.count(dif1) ){
  47. 			int pastSum = mp[dif1];
  48. 			ans = max(ans, sum - pastSum + dif1);	
  49. 			isAns = true;
  50. 		}
  51. 		if(mp.count(dif2) ){
  52. 			int pastSum = mp[dif2];
  53. 			ans = max(ans, sum - pastSum + dif2);	
  54. 			isAns = true;
  55. 		}
  56.  
  57. 		if(mp.count(x)){
  58. 			mp[x] = min(mp[x], sum);
  59. 		}
  60. 		else mp[x] = sum;
  61. 	}
  62.  
  63. 	return ans;
  64. }
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80. int practice(int n, int k){
  81.  
  82.  
  83.     return 0;
  84. }
  85.  
  86.  
  87.  
  88.  
  89.  
  90. void solve() {
  91.  
  92.     int n, k;
  93.     cin>> n >> k;
  94.  
  95.     a.resize(n);
  96.     for(int i=0; i<n; i++) cin >> a[i];
  97.  
  98.     cout << consistency(n, k) << endl;
  99.  
  100.  
  101. }
  102.  
  103.  
  104.  
  105.  
  106.  
  107. int32_t main() {
  108.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  109.  
  110.     int t = 1;
  111.     cin >> t;
  112.     while (t--) {
  113.         solve();
  114.     }
  115.  
  116.     return 0;
  117. }
Success #stdin #stdout 0s 5316KB
comments (?)
stdin
copy 
1
8 5
1 5 -5 8 8 8 10 15
stdout
copy 
34
https://ideone.com/CHoRoq
language:
C++14 (gcc 8.3)
created:
15 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!