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 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 161 |
4 | Um_nik | 160 |
5 | atcoder_official | 159 |
6 | djm03178 | 157 |
7 | adamant | 153 |
8 | luogu_official | 150 |
9 | awoo | 149 |
10 | TheScrasse | 146 |
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?