| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 8 | SecondThread | 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.