Hi community. Is there anyone can make comment about the O(n) time complexity approach for the following problem? In the problem analysis part, author talks about it (There is also a O(N) solution to this problem using hash tables. It is left as an exercise to the reader.) but does not give thee details. I appreciate if you help about the matter. Thank you.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 165 |
| 2 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
→ Найти пользователя
→ Прямой эфир
How O(n) is possible for this Google Kickstart 2019 Round C problem Wiggle Walk?
Правка en1, от serhatgiydiren, 2020-03-26 14:30:05
История
Правки
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en3 |
|
serhatgiydiren | 2020-03-26 20:14:41 | 5 | Tiny change: 'e who can make comment a' -> 'e who can comment a' | |
| en2 |
|
serhatgiydiren | 2020-03-26 14:30:38 | 4 | Tiny change: 're anyone can make ' -> 're anyone who can make ' | |
| en1 |
|
serhatgiydiren | 2020-03-26 14:30:05 | 553 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 15.11.2024 10:59:49 (j3).
Десктопная версия, переключиться на мобильную.
При поддержке
