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. string a;
  31.  
  32. string consistency(int n, int k){
  33.  
  34. vector<int> dp(n);
  35. dp[0] = 1;
  36. int maxi = 1;
  37.  
  38. for(int i=2; i<n; i++){
  39. if( abs(a[i] - a[i-1]) <= k ) dp[i] = dp[i-1] + 1;
  40. else dp[i] = 1;
  41.  
  42. maxi = max(maxi, dp[i]);
  43. }
  44.  
  45. int s = 0, e = 0;
  46. while(e<n){
  47.  
  48. if( abs(a[e] - a[s]) > k ){
  49. s = e;
  50. }
  51.  
  52. if(e-s+1 < maxi){
  53. e++;
  54. }
  55. else{
  56. return a.substr(s, maxi);
  57. }
  58. }
  59.  
  60. return "-1";
  61. }
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77. int practice(int n){
  78.  
  79.  
  80. return 0;
  81. }
  82.  
  83.  
  84.  
  85.  
  86.  
  87. void solve() {
  88.  
  89. int n, k;
  90. cin >> n >> k;
  91.  
  92. cin >> a;
  93.  
  94. cout << consistency(n, k) << endl;
  95.  
  96.  
  97. }
  98.  
  99.  
  100.  
  101.  
  102.  
  103. int32_t main() {
  104. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  105.  
  106. int t = 1;
  107. // cin >> t;
  108. while (t--) {
  109. solve();
  110. }
  111.  
  112. return 0;
  113. }
Success #stdin #stdout 0s 5316KB
stdin
14 1
ababbacaabbbb
stdout
ababba