Vova面临一个关于睡眠安排的问题，他需要在一天内睡n次，每次睡h小时。如果他在l到r（包括l和r）的时间范围内开始睡觉，那么这次睡眠就被认为是优质的。Vova可以选择在第ii次睡眠前a_i或a_i-1小时开始。任务是确定Vova最多可以有多少次优质睡眠。给定n, h, l, r和一系列的a_i，需要找出最优策略并输出最大优质睡眠次数。"
135040541,7337247,人工智能与云计算：变革技术的应用与原理,"['AI', '深度学习', '云计算', '机器学习', '自然语言处理']
链接：https://codeforces.ml/contest/1324/problem/E
Vova had a pretty weird sleeping schedule. There are hh hours in a day. Vova will sleep exactly nn times. The ii-th time he will sleep exactly after aiai 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 00). Each time Vova sleeps exactly one day (in other words, hh hours).
Vova thinks that the ii-th sleeping time is good if he starts to sleep between hours ll and rr inclusive.
Vova can control himself and before the ii-th time can choose between two options: go to sleep after aiai hours or after ai−1ai−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,ln,h,l and rr (1≤n≤2000,3≤h≤2000,0≤l≤r<h1≤n≤2000,3≤h≤2000,0≤l≤r
最低0.47元/天 解锁文章
扫一扫
947
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
