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.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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.
Name |
---|
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?