CF487B.Strip

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

Alexandra has a paper strip with $n$ numbers on it. Let's call them $a_{i}$ from left to right.

Now Alexandra wants to split it into some pieces (possibly $1$ ). For each piece of strip, it must satisfy:

Each piece should contain at least $l$ numbers.
The difference between the maximal and the minimal number on the piece should be at most $s$ .

Please help Alexandra to find the minimal number of pieces meeting the condition above.

Alexandra has a paper strip with $n$ numbers on it. Let's call them $a_{i}$ from left to right.

Now Alexandra wants to split it into some pieces (possibly $1$ ). For each piece of strip, it must satisfy:

Each piece should contain at least $l$ numbers.
The difference between the maximal and the minimal number on the piece should be at most $s$ .

Please help Alexandra to find the minimal number of pieces meeting the condition above.

Output the minimal number of strip pieces.

If there are no ways to split the strip, output -1.

Alexandra has a paper strip with $n$ numbers on it. Let's call them $a_{i}$ from left to right.

Now Alexandra wants to split it into some pieces (possibly $1$ ). For each piece of strip, it must satisfy:

Each piece should contain at least $l$ numbers.
The difference between the maximal and the minimal number on the piece should be at most $s$ .

Please help Alexandra to find the minimal number of pieces meeting the condition above.