-
Notifications
You must be signed in to change notification settings - Fork 1
/
Dp2.cpp
43 lines (43 loc) · 1.32 KB
/
Dp2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;i<=n;i++)
#define pa pair<ll,ll>
#define vec vector<ll>
#define pb push_back
#define in insert
#define mp make_pair
#define F first
#define S second
//memset(x, 0, sizeof(x))
ll inf = (ll)1e18;
ll mod = 1e9 + 7;
ll max1 = (ll)1e9, a[2005], dp[2005][2005], l, r, h, ct = 0;
ll ways(ll i, ll n, ll st, ll ans) {
if (i == n) return ans;
else {
ll st1 = (st + a[i]) % h, st2 = (st + a[i] - 1) % h;
if (st1 == 0) st1 = h;
if (st2 == 0) st2 = h;
if (l <= st1 && r >= st1 && l <= st2 && r >= st2) return max(ways(i + 1, n, st1, ans + 1), ways(i + 1, n, st2, ans + 1));
else if (l <= st1 && r >= st1) return max(ways(i + 1, n, st1, ans + 1), ways(i + 1, n, st2, ans));
else if (l <= st2 && r >= st2) return max(ways(i + 1, n, st1, ans), ways(i + 1, n, st2, ans + 1));
else return max(ways(i + 1, n, st1, ans), ways(i + 1, n, st2, ans));
}
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("err.txt", "w", stderr);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i, j, k, n, m, ct = 0, t, ans = 0;
cin >> n >> h >> l >> r;
for (i = 0; i < n; i++) cin >> a[i];
memset(dp, -1, sizeof(dp));
cout << ways(0, n, 0, 0) << endl;
return 0;
}