fork download
  1. #include <bits/stdc++.h>
  2. #include <chrono>
  3. using namespace std;
  4. using namespace chrono;
  5. // "AJEET JAIN"----"JAI JINENDRA"
  6. /* "णमो अरिहंताणं",
  7.   "णमो सिद्धाणं",
  8.   "णमो आयरियाणं",
  9.   "णमो उवज्झायाणं",
  10.   "णमो लोए सव्वसाहूणं",
  11.   "",
  12.   "एसो पंच नमोक्कारो, सव्व पावप्पणासणो",
  13.   "मंगलाणं च सव्वेसिं, पडमं हवै मंगलं", */
  14.  
  15.  
  16. // Aliases to op
  17. using ll = long long;
  18. using ull = unsigned long long;
  19. using ld = double;
  20. using vll = vector<ll>;
  21.  
  22.  
  23. // Constants
  24. constexpr ll INF = 4e18;
  25. constexpr ld EPS = 1e-9;
  26. constexpr ll MOD = 1e9 + 7;
  27.  
  28.  
  29.  
  30. // Macros
  31. #define F first
  32. #define S second
  33. #define all(x) begin(x), end(x)
  34. #define allr(x) rbegin(x), rend(x)
  35. #define py cout<<"YES\n";
  36. #define pn cout<<"NO\n";
  37. #define forn(i,n) for(int i=0;i<n;i++)
  38. #define for1(i,n) for(int i=1;i<=n;i++)
  39.  
  40. // #define insert push_back
  41. #define pb push_back
  42. #define MP make_pair
  43. #define endl '\n'
  44.  
  45. /*
  46.   remove substring or subarray ---> try to think about sliding w
  47.  
  48.   */
  49.  
  50. /*
  51.  
  52.   Golden Rule
  53.  
  54.   1) problem is easy
  55.   2) proofs is easy
  56.   3) implementation is easy
  57.  
  58.   /*
  59.   ROUGH --
  60.  
  61.   */
  62. long long countSubarraysWithSumAtMostK(vector<char> &b, long long k) {
  63. int n = b.size();
  64. long long i = 0, diff = 0, count = 0 , ans = 0;
  65. multiset<char> m;
  66.  
  67. for (int j = 0; j < n; j++) {
  68. m.insert(b[j]);
  69.  
  70. while (*m.rbegin() - *m.begin() > k && !m.empty()) {
  71. m.erase(m.find(b[i]));
  72. i++;
  73. }
  74. count = (j - i + 1);
  75. ans = max( ans , count );
  76. }
  77.  
  78. return ans;
  79. }
  80.  
  81.  
  82. void AJNJ(){
  83. ll n,k;
  84. cin>>n>>k;
  85.  
  86. vector<char> b(n);
  87. for1(i , n){
  88. cin >> b[i];
  89. }
  90.  
  91. cout << countSubarraysWithSumAtMostK(b , k) << endl;
  92.  
  93. }
  94.  
  95.  
  96. int main(){
  97. ios::sync_with_stdio(0);
  98. cin.tie(0);
  99. cout.tie(0);
  100. int T = 1;
  101. cin>>T;
  102. auto start1 = high_resolution_clock::now();
  103. while(T--){
  104. AJNJ();
  105. }
  106. auto stop1 = high_resolution_clock::now();
  107. auto duration = duration_cast<microseconds>(stop1 - start1);
  108. cerr << "Time: " << duration . count() / 1000 << " ms" << endl;
  109.  
  110. return 0;
  111. }
Success #stdin #stdout #stderr 0s 5320KB
stdin
Standard input is empty
stdout
0
stderr
Time: 0 ms