This is the problem .
According to the accepted solution of other coders, the following test case gives a "Yes". But, shouldn't it give a "No" ?
6 1 2 1 1 1 1 1 1 6
Any help would be really appreciated.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
This is the problem .
According to the accepted solution of other coders, the following test case gives a "Yes". But, shouldn't it give a "No" ?
6 1 2 1 1 1 1 1 1 6
Any help would be really appreciated.
Название |
---|
Note that the non-decreasing and the non-increasing sequences are also considered ladders.
Yeah, I understand that.
But the given query is on the range of [1, 6]. In that range, the sequence is [2, 1, 1, 1, 1, 1].
So, it is decreasing, and then non-decreasing/non- increasing. Hence, this doesn't qualify as a ladder.
Because the question says, it should satisfy either of the three criteria:
But, the given is decreasing and then non- decreasing. Hence, it doesn't qualify in either of the three criteria.
"it is decreasing" --> it is non-increasing. Thus point 3 is satisfied.
It is still failing.
My submission
Can you tell your approach?