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.  
  26. vector<int> a;
  27. void  consistency(int n, int k) {
  28.     int m = 300005;
  29.     vector<int> diff(m, 0);
  30.  
  31.     for(int i=0; i<n; i++){
  32.     	int s = a[i]-k;
  33.     	int e = a[i]+k;
  34.  
  35.     	diff[s]++;
  36.     	if(e+1<m) diff[e+1]--;
  37.     }
  38.  
  39.     int ans = 0;
  40.     for(int i=1; i<m; i++){
  41.     	diff[i] += diff[i-1];
  42.     	ans = max(ans, diff[i]);
  43.     }
  44.  
  45.     cout << ans << endl;
  46.  
  47. }
  48.  
  49. void solve() {
  50.  
  51. 	int n, k;
  52. 	cin >> n >> k;
  53.  
  54. 	a.resize(n);
  55. 	for(int i=0; i<n; i++) cin >> a[i];
  56.  
  57. 	consistency(n, k);
  58.  
  59. }
  60.  
  61.  
  62.  
  63.  
  64.  
  65. int32_t main() {
  66.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  67.  
  68.     int t = 1;
  69.     cin >> t;
  70.     while (t--) {
  71.         solve();
  72.     }
  73.  
  74.     return 0;
  75. }
Success #stdin #stdout 0.01s 5488KB
comments (?)
stdin
copy 
1
5 2
4 7 6 9 12
stdout
copy 
3
https://ideone.com/Eqqczn
language:
C++14 (gcc 8.3)
created:
6 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!