i don't know what is wrong with my idea. I tried many times but still wrong answer. can anyone tell me what is wrong?
source : http://www.spoj.com/problems/GSS2/
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3821 |
| 3 | Benq | 3736 |
| 4 | Radewoosh | 3631 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3388 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 10.11.2024 13:50:29 (k2).
Десктопная версия, переключиться на мобильную.
При поддержке
I can't see how you handled the idea of removing duplicates. I solved it using a offline approach. Quora has a nice tutorial on it.
It is harder than GSS3, GSS4 and GSS5. Maybe you want to try them first if you are going to solve them all.
i also use offline. i sort the queries wrt right position. if any value appear previously I set 0 at the previous position of the segment tree, and insert the value at the current position. then i use GSS1.
Explain this:
tn.ms = max({0LL, l.ms, r.ms, l.rs+r.ls});