Anyone can tell me a problem can be solved with K-D tree or Segment tree..
Thanks in advance
# | User | Rating |
---|---|---|
1 | tourist | 3771 |
2 | jiangly | 3688 |
3 | Um_nik | 3539 |
4 | slime | 3498 |
5 | djq_cpp | 3486 |
6 | MiracleFaFa | 3466 |
7 | ksun48 | 3452 |
8 | Radewoosh | 3406 |
9 | greenheadstrange | 3393 |
10 | xtqqwq | 3382 |
# | User | Contrib. |
---|---|---|
1 | -is-this-fft- | 183 |
2 | awoo | 181 |
3 | YouKn0wWho | 177 |
4 | Um_nik | 175 |
5 | dario2994 | 172 |
6 | Monogon | 171 |
7 | adamant | 168 |
8 | maroonrk | 167 |
9 | antontrygubO_o | 166 |
10 | errorgorn | 164 |
Anyone can tell me a problem can be solved with K-D tree or Segment tree..
Thanks in advance
Name |
---|
I think you could solve GSS series in SPOJ. Here is a link http://www.spoj.com/problems/GSS1/ I hope it will be helpful for you :)
thx for your help :)
Wow! I just realized that you were solving such kind of problems! I never did that in my university life time. LOL. But that's great, solve all problems!
that's for Desain and Analysis algorithm programming assessment.. LOL
Insane! :D