| # | 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 | 151 |
For practising segment trees I was trying the GSS1 problem of SPOJ. When I ran my code on SPOJ it failed on the 9th test case. After some debugging, i came up with test case 6 1 2 80 79 -90 -8 1 1 6
But results got worse *** glibc detected *** demo: free(): invalid next size (fast): 0x0000000002371510 ***
Can someone help me out with this error?
http://pastebin.com/6NSwEHHz Here is my code. Any help will be much appreciated.
I have been stuck at this problem for quite sometime
http://mirror.codeforces.com/problemset/problem/234/G
I will be grateful if someone can assist me on this. I fail to understand how we to prove the optimality condition as well as how to enumerate the team configuration.
Thanks in advance.
Can someone help me out with some links that will help me out with the methods of centroid decomposition and heavy light decomposition. Thanks in advance.
