| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | adamant | 164 |
| 2 | awoo | 164 |
| 4 | TheScrasse | 160 |
| 5 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Hi everyone, I was attempting the following question: http://www.spoj.com/problems/FREQUENT/
I tried to use Segment trees for this question but I am getting WA. Please help me get an idea about where I am wrong. Here is the link to the code: http://ideone.com/leiE86
Thanking you, Maulik
What about your search , when you found a empty segment (Line 82) you are puting many flag values this strategy is correct , but you are forgeting what to do when in (Line 82) when your get recursively from LEFT and RIGHT , and imagine that LEFT is an invalid segment (in this case i think that you are not considering this case) the same when RIGHT is an empty segment.