I am trying to solve this problem: NEKAMELEONI I have read the tutorial but I can not understand what it says. Can anyone tell me more about this interesting problem? Thank in advance!
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
19:27:59
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
19:27:59
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.11.2024 22:07:03 (i1).
Десктопная версия, переключиться на мобильную.
При поддержке
You are given an array with N integers ar ( for all i (1<=i<=N) 1<=ar[i]<=K ) and you have M task in each task you are given a x number . if x is 1 you are given 2 more numbers a and b it means you must change ar[a] into b if x is 2 you must find a subarray that contains all [1,K] numbers and it must be the shortest contiguous subarray and you must print its length if there is no subarray that contains all [1,K] numbers you must print "-1" (that is what i understand on the problem , it can be wrong) (sorry for bad english)
How can we solve this problem? I have read tutorial but I can not understand the way we solve this. Could you tell me how to solve this one? You can find the tutorial here : Tutorial
segment tree :D but this problem is not easy :D I think the merge function is hard . (I know the solution but It's really hard for me to explain it) how ever I think if you learn segment tree and then you take a look at Petr code , you will understand the solution
Could you give me Petr's code? I know Segment tree, but I can not understand how can I merge, the solution seems very difficult for me to understand.
oh , sorry . I saw your comment now
here is the code : http://hsin.hr/coci/solutions/PetrM/contest3_nkamel.cpp
You have solution on this site https://www.hsin.hr/coci/
I read that solution but I can not understand. Could you give me any hints to solve this problem?