- Hello
- Suppose we heve a balck box that can get a tree and each time we give it two vertex (for example u , v)it gives us lowest common ancestor (LCA) of u and v.
- Now you have an array A of size N and you have given M queri , each query have two integer L , R that want you to find minimum integer from L to R in A , use black box to answer each query.
- please write your solution in comment :))
→ Обратите внимание
Соревнование идет
2023 Post World Finals Online ICPC Challenge powered by Huawei
13 дней
Зарегистрироваться »
2023 Post World Finals Online ICPC Challenge powered by Huawei
13 дней
Зарегистрироваться »
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | SecondThread | 145 |
| 9 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
- Hello
- I searched for SCC (strongly connected components) problems and I had found three good problems that I want to share with you. if you know more problem about this algorithm write in the comment :))
- check post
- Mr. Kitayuta's Technology
- capital city (from spoj)
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 07.05.2024 16:17:28 (j3).
Десктопная версия, переключиться на мобильную.
При поддержке
