[Codeforces Round #627]1324E - Sleeping Schedule[dp]

1324E - Sleeping Schedule[$dp$]

time limit per test	memory limit per test	input	output
2 seconds	256 megabytes	standard input	standard output

Description:

Vova had a pretty weird sleeping schedule. There are $h$ hours in a day. Vova will sleep exactly $n$ times. The $i$-th time he will sleep exactly after $a_i$ hours from the time he woke up. You can assume that Vova woke up exactly at the beginning of this story (the initial time is $0$). Each time Vova sleeps exactly one day (in other words, $h$ hours).
Vova thinks that the $i$-th sleeping time is good if he starts to sleep between hours $l$ and $r$ inclusive.
Vova can control himself and before the $i$-th time can choose between two options: go to sleep after $a_i$ hours or after $a_i-1$ hours.
Your task is to say the maximum number of good sleeping times Vova can obtain if he acts optimally.

Input

The first line of the input contains four integers $n,h,l$ and $r$ $(1\le n\le 2000,3\le h\le 2000,0\le l\le r<h)$ — the number of times Vova goes to sleep, the number of hours in a day and the segment of the good sleeping time.
The second line of the input contains $n$ integers $a_1,a_2,\dots ,a_n$ $(1\le a_i<h)$, where $a_i$ is the number of hours after which Vova goes to sleep the $i$-th time.

Output

Print one integer — the maximum number of good sleeping times Vova can obtain if he acts optimally.

---

Example input

7 24 21 23
16 17 14 20 20 11 22

Example output

3

Note

The maximum number of good times in the example is $3$.
The story starts from $t=0$. Then Vova goes to sleep after $a_1-1$ hours, now the time is $15$. This time is not good. Then Vova goes to sleep after $a_2-1$ hours, now the time is $15+16=7$. This time is also not good. Then Vova goes to sleep after $a_3$ hours, now the time is $7+14=21$. This time is good. Then Vova goes to sleep after $a_4-1$ hours, now the time is $21+19=16$. This time is not good. Then Vova goes to sleep after $a_5$ hours, now the time is $16+20=12$. This time is not good. Then Vova goes to sleep after $a_6$ hours, now the time is $12+11=23$. This time is good. Then Vova goes to sleep after $a_7$ hours, now the time is $23+22=21$. This time is also good.

---

分析：
题意：
Vova第$0$小时是醒着的，他的第一次睡眠应该是从第$0$小时开始
设定一天有$h$小时，Vova总共可以睡$n$次（不是一天内睡$n$次）
如果每次睡着后醒来的时间正好在$[l,r]$内，这表示这是一次好睡眠
Vova可以选择第$i$-th睡$a_i$小时或者$a_i-1$小时
问Vova最多可以有几次好睡眠
做法：
$dp[i][j]$表示第$i$-th睡眠可以在$j$时醒来，最大的好睡眠的次数
初始化$dp[i][j]=-1$，表示全都还不能到达
$dp[0][0]=0$，一开始是醒着的
如果$dp[i-1][j]$可以到达
那么有两种可能，选择睡$a_i$小时或者$a_i-1$小时
两种都要算一次

dp[i][t] = max(dp[i][t], dp[i-1][j]);
if(t >= l && t <= r)
	dp[i][t] = max(dp[i][t], dp[i-1][j] + 1);
ans = max(ans, dp[i][t]);

Code:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e3 + 5;

int a[maxn];
int dp[maxn][maxn];
int n, h, l, r, ans;

void solve(int i, int j, int t) {
    dp[i][t] = max(dp[i][t], dp[i-1][j]);
    if(t >= l && t <= r)
        dp[i][t] = max(dp[i][t], dp[i-1][j] + 1);
    ans = max(ans, dp[i][t]);
}

int main() {
    scanf("%d%d%d%d", &n, &h, &l, &r);
    for(int i = 1; i <= n; ++i)
        scanf("%d", &a[i]);
    ans = 0;
    memset(dp, -1, sizeof(dp));
    dp[0][0] = 0; // 一开始以为也可以从1开始睡觉
    for(int i = 1; i <= n; ++i) {
        for(int j = 0; j < h; ++j) {
            if(dp[i - 1][j] == -1) continue; // 不可以到达
            solve(i, j, (j + a[i]) % h);
            solve(i, j, (j + a[i] - 1 + h) % h);
        }
    }
    printf("%d\n", ans);
    return 0;
}

/**
7 24 21 23
16 17 14 20 20 11 22
*/

---