|
|
вернуться в форумПоказать все сообщения Спрятать все сообщенияIs It a specific data structure or may be not? It's balanced binary trees, I guess. Red-black trees should work. Yes, index tree is very quick and requires quite small amount of memory. I used bucket method. It got AC. But in order to avoid TLE you have to play a little with parameters of bucket. |
|
|