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