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. string a;
  30.  
  31. //* Template 1 : 
  32. //* 	Start with valid window 
  33.  
  34. int consistency1(int n, int k) {
  35.  
  36. 	deque<int> up, down;
  37.  
  38. 	int s = 0, e = 0;
  39. 	int ans = 0;
  40.  
  41. 	while(e<n){
  42. 		while(!up.empty() && a[e] < a[up.back()]) up.pop_back();
  43. 		up.push_back(e);
  44.  
  45. 		while(!down.empty() && a[e] > a[down.back()]) down.pop_back();
  46. 		down.push_back(e);
  47.  
  48.  
  49. 		int maxi = a[down.front()];
  50. 		int mini = a[up.front()];
  51.  
  52. 		if(maxi - mini <= k){
  53. 			ans = max(ans, e-s+1);
  54. 			e++;
  55. 		}
  56. 		else{
  57. 			while(s<=e){
  58. 				int maxi = a[down.front()];
  59. 				int mini = a[up.front()];
  60.  
  61. 				if(maxi - mini <= k) break;
  62.  
  63. 				if(s == down.front()) down.pop_front();
  64. 				if(s == up.front()) up.pop_front();
  65.  
  66. 				s++;
  67. 			}
  68.  
  69. 			ans = max(ans, e-s+1);
  70. 			e++;
  71. 		}
  72.  
  73. 	}
  74.  
  75. 	return ans;
  76.  
  77. }
  78.  
  79.  
  80.  
  81.  
  82. int consistency2(int n, int k) {
  83.  
  84. 	deque<int> up, down;
  85.  
  86. 	int s = 0, e = 0;
  87. 	int ans = 0;
  88.  
  89. 	while(e<n){
  90. 		while(!up.empty() && a[e] < a[up.back()]) up.pop_back();
  91. 		up.push_back(e);
  92.  
  93. 		while(!down.empty() && a[e] > a[down.back()]) down.pop_back();
  94. 		down.push_back(e);
  95.  
  96.  
  97. 		while(s<=e){
  98. 			int maxi = a[down.front()];
  99. 			int mini = a[up.front()];
  100.  
  101. 			if(maxi - mini <= k) break;
  102.  
  103. 			if(s == down.front()) down.pop_front();
  104. 			if(s == up.front()) up.pop_front();
  105.  
  106. 			s++;
  107. 		}
  108.  
  109. 		ans = max(ans, e-s+1);
  110. 		e++;
  111.  
  112. 	}
  113.  
  114. 	return ans;
  115.  
  116. }
  117.  
  118.  
  119.  
  120.  
  121.  
  122.  
  123.  
  124.  
  125.  
  126.  
  127.  
  128.  
  129.  
  130.  
  131.  
  132.  
  133.  
  134.  
  135.  
  136.  
  137.  
  138.  
  139. int practice(int n, int k){
  140.  
  141.  
  142. }
  143.  
  144.  
  145.  
  146.  
  147.  
  148.  
  149. void solve() {
  150.  
  151.     int k;
  152.     cin >> k;
  153.  
  154. 	cin >> a;
  155. 	int n = a.size();
  156.  
  157.     cout << consistency1(n, k) << " " << consistency2(n, k) << endl;
  158.  
  159. }
  160.  
  161.  
  162.  
  163.  
  164.  
  165. int32_t main() {
  166.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  167.  
  168.     int t = 1;
  169.     // cin >> t;
  170.     while (t--) {
  171.         solve();
  172.     }
  173.  
  174.     return 0;
  175. }
Success #stdin #stdout 0s 5324KB
comments (?)
stdin
copy 
2
abccabcdabdabd
stdout
copy 
7 7
https://ideone.com/Bw0LBw
language:
C++14 (gcc 8.3)
created:
58 minutes 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!