|
|
вернуться в форумПоказать все сообщения Спрятать все сообщения1499 svr 19 окт 2006 00:59 How many structures need quick solution. I worked with segments [i,j] on [1,N] and used 1: short num[50000] for quicksort of segments; 2: short prev[50000] for fathes of segments. Segment I is father of segment J if I smallest segment containing J. 3: vector<short>sons[50000] for sons of segments. Last structure very slow and I had bad Ac time 0.95. Re: 1499 Denis Koshman 13 авг 2008 05:55 Edited by author 13.08.2008 06:08 |
|
|