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