fork 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.  
  29.  
  30. vector<int> a;
  31.  
  32. //* For Sorted array 
  33.  
  34. int consistency(int n, int k){
  35.  
  36.     int len = 0;
  37.  
  38.     int s = 0, e = 0;   
  39.  
  40.     while(e<n){
  41.  
  42.         if( a[e] - a[s]  <= k){
  43.             len = max(len, e-s+1);
  44.             e++;
  45.         }
  46.         else{
  47.             while(s<=e && a[e] - a[s] > k){
  48.                 s++;
  49.             }
  50.  
  51.             len = max(len, e-s+1);
  52.             e++;
  53.         }
  54.     }
  55.  
  56. 	return len;
  57. }
  58.  
  59.  
  60.  
  61.  
  62.  
  63. //* For Unsorted array : 
  64.  
  65. //* Template 1 : 
  66.  
  67. int consistency1(int n, int k){
  68.  
  69.     int len = 0;
  70.  
  71.     deque<int> up;
  72.     deque<int> down;    
  73.  
  74.     int s = 0, e = 0;   
  75.  
  76.     while(e<n){
  77.         while(!up.empty() && a[e] < a[up.back()]) up.pop_back();
  78.         up.push_back(e);    
  79.  
  80.         while(!down.empty() && a[e] > a[down.back()]) down.pop_back();
  81.         down.push_back(e);  
  82.  
  83.         int mini = a[up.front()];
  84.         int maxi = a[down.front()]; 
  85.  
  86.         if(maxi - mini <= k){
  87.             len = max(len, e-s+1);
  88.             e++;
  89.         }
  90.         else{
  91.             while(s<=e){
  92.                 int mini = a[up.front()];
  93.                 int maxi = a[down.front()]; 
  94.  
  95.                 if(maxi - mini <= k) break; 
  96.  
  97.                 if(s == up.front()) up.pop_front();
  98.                 if(s == down.front()) down.pop_front();
  99.                 s++;
  100.             }
  101.  
  102.             if(maxi - mini <= k) len = max(len, e-s+1);
  103.             e++;
  104.         }
  105.     }
  106.  
  107. 	return len;
  108. }
  109.  
  110.  
  111.  
  112.  
  113.  
  114. //* Template 2 : 
  115.  
  116. int consistency2(int n, int k){
  117.  
  118.     int len = 0;
  119.  
  120.     deque<int> up;
  121.     deque<int> down;    
  122.  
  123.  
  124.     for(int i=0, j=0; i<n; i++){
  125.         while(!up.empty() && a[i] < a[up.back()]) up.pop_back();
  126.         up.push_back(i);    
  127.  
  128.         while(!down.empty() && a[i] > a[down.back()]) down.pop_back();
  129.         down.push_back(i);  
  130.  
  131.         int mini = a[up.front()];
  132.         int maxi = a[down.front()]; 
  133.  
  134.         while(j<=i){
  135.             int mini = a[up.front()];
  136.             int maxi = a[down.front()]; 
  137.  
  138.             if(maxi - mini <= k) break; 
  139.  
  140.             if(j == up.front()) up.pop_front();
  141.             if(j == down.front()) down.pop_front();
  142.             j++;
  143.         }
  144.  
  145.         if(maxi - mini <= k) len = max(len, i-j+1);
  146.     }
  147.  
  148. 	return len;
  149. }
  150.  
  151.  
  152.  
  153.  
  154.  
  155.  
  156.  
  157.  
  158.  
  159.  
  160.  
  161.  
  162. int practice(int n, int k){
  163.  
  164.  
  165.     return 0;
  166. }
  167.  
  168.  
  169.  
  170.  
  171.  
  172. void solve() {
  173.  
  174.     int n, k;
  175.     cin>> n >> k;
  176.  
  177.     a.resize(n);
  178.     for(int i=0; i<n; i++) cin >> a[i];
  179.  
  180.     cout << consistency(n, k)  << " " << consistency1(n, k) << " " <<  consistency2(n, k) << endl;
  181.  
  182.  
  183. }
  184.  
  185.  
  186.  
  187.  
  188.  
  189. int32_t main() {
  190.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  191.  
  192.     int t = 1;
  193.     // cin >> t;
  194.     while (t--) {
  195.         solve();
  196.     }
  197.  
  198.     return 0;
  199. }
Success #stdin #stdout 0.01s 5280KB
comments (?)
stdin 
11 30
5 9 20 22 28 35 60 350 358 359 360
stdout 
6 6 6
https://ideone.com/IERBv5
language:
C++14 (gcc 8.3)
created:
4 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!