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/
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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/
Name |
---|
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});