OJ Board

Hello Everyone,

I would like to invite you all to "CodeCraft 08", a programming contest conducted by IIIT, Hyderabad as part of their technical fest "Threads". The contest is scheduled on 27th January. The contest is open to everyone. For more details and to register for the event, please visit ...

Hmmmmmm ..... You are correct. I too think that I am lucky enough to get accepted. Anyway for normal contests I don't think that anybody tries linear time suffix array construction. [ I suppose it would be complicated ].

Hi ,
Well yeah the order is kind of O(n^2 * log n ) but the point is that not every comparison while sorting takes O(N) time. So the time taken will be very less in practice ( most cases ). And moreover if the string is sufficiently dissimilar in its characters then this method would run in ...

Hi,
I don't understand the fact that a bank can be robbed more than once ... I did exactly same as ImLazy has written above but I always get WA :cry::cry:. My programs output matches with the above output on all the 50 cases [ I suppose the output shown above is correct ]. Can somebody help me out ...

I think you don't actually need to store all the suffixes separately. What you can do is just store the indexes in a single dimentional array and whenever you have to access any particular suffix just use the position stored in the suffix array to do that. A very naive approach to build the suffix ...