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 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
7 | SecondThread | 150 |
9 | orz | 146 |
10 | pajenegod | 145 |
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?