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 | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
1 | maomao90 | 161 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
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});