|
|
вернуться в форумHow Can I Solve It? -> Is It a specific data structure or may be not? Re: How Can I Solve It? -> It's balanced binary trees, I guess. Red-black trees should work. Re: How Can I Solve It? -> Just Index tree:D Re: How Can I Solve It? -> Yes, index tree is very quick and requires quite small amount of memory. Re: How Can I Solve It? -> Послано SPIRiT 15 фев 2007 15:01 I used bucket method. It got AC. But in order to avoid TLE you have to play a little with parameters of bucket. |
|
|