Unirytmi

#include <iostream>
#include <map>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
vector<ll> v;
map<ll,ll> maa;
ll n, a, b, c, m;

ll haku(ll h) {
  if (h >= m) return 0;
  ll s = 0;
  auto y = upper_bound(v.begin(), v.end(), h);
  ll x = maa[*y];
  if (v[x] < h+a) {
    while (x < n && v[x] < h+a) {
      s ++;
      x ++;
    }
  }
  ll ma = s + haku(h+a+c);
  for (int i = h+a+1; i <= h+b; ++i) {
    while(x < n && v[x] < i) {
      s ++;
      x ++;
    }
    ll ss = s + haku(i+c);
    ma = max(ss, ma);
  }
  //cout << h << " " << s << " " << ma << " " << x << endl;
  return ma;
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  ll x;
  cin >> n >> a >> b >> c;
  for (int i = 0; i < n; ++i) {
    cin >> x;
    v.push_back(x);
    maa[x] = i;
  }
  m = v.back();
  cout << haku(0) << endl;
}

Test 1

Group: 1, 2, 3, 4

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3, 4

Verdict: ACCEPTED

Test 3

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2, 3, 4

Verdict: ACCEPTED

Test 5

Group: 3, 4

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3, 4

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 1, 2, 3, 4

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3, 4

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 1, 2, 3, 4

Verdict: ACCEPTED

Test 13

Group: 1, 2, 3, 4

Verdict: ACCEPTED

Test 14

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 2, 3, 4

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED