Discussion @ 1316. Electronic Auction @ Timus Online Judge

How Can I Solve It? ->

Posted by Ilya Rasenstein (8 class) 29 May 2004 17:58

Is It a specific data structure or may be not?

Re: How Can I Solve It? ->

Posted by [OSTU] Alex Svetkin 13 Sep 2004 21:27

It's balanced binary trees, I guess. Red-black trees should work.

Re: How Can I Solve It? ->

Posted by Saturn (HUS) 13 Sep 2004 23:37

Just Index tree:D

Re: How Can I Solve It? ->

Posted by Vedernikoff Sergey 13 Aug 2005 01:22

Yes, index tree is very quick and requires quite small amount of memory.

Re: How Can I Solve It? ->

Posted by SPIRiT 15 Feb 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.

Discussion of Problem 1316. Electronic Auction