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!
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 11.11.2026 11:38:39 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
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?