http://acm.timus.ru/problem.aspx?num=1028
can somenone explain me how to do it using segment tree????
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 29.04.2026 13:20:08 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
It's clearly classic segment tree
first of all sort all points in increasing order, then start from first point in sorted list and count number of points with smaller or equal Y than this point in segment tree and after that increase value of point's Y in segment tree and see next point in sorted list ...
this is my accepted code
i am getting WA on test case 3 :(
here is my code: http://pastebin.com/W0iHVkt2
i have created a tree the lowest level having leaves like 0-1,1-2,2-3 etc
the in the query i have add all the ranges which is lower the query number(the global variable L will hold the info)
like query(5) will return the total numbers which are in range (0-3)+(3-5)
the i have update the whole tree if the the number is in between the range
whats wrong with the idea ???
GOT AC after 1 day of coding
SO HAPYYY
GREAT THANKS MMJ
Congratulations ! your welcome :)