solution is that check if there is an entry in the array from i=2 to i=n-1; such that a[i]<a[i-1]&&a[i]<a[i+1]. If there is such a value ans is NO else answer is always "YES". This is an easy way to solve that problem.... OK................
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
hint to solve pillars problem educational codeforces round division 2.
solution is that check if there is an entry in the array from i=2 to i=n-1; such that a[i]<a[i-1]&&a[i]<a[i+1]. If there is such a value ans is NO else answer is always "YES". This is an easy way to solve that problem.... OK................
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en2 | AM_I_Learning | 2019-07-23 13:50:22 | 23 | Tiny change: 'at problem' -> 'at problem.... OK................' (published) | ||
en1 | AM_I_Learning | 2019-07-23 13:49:36 | 291 | Initial revision (saved to drafts) |
Название |
---|