1459 - Maximal Lexicographic Rotation

Discussion around the problems of the COJ.
Forum rules
Remember that posting AC code is not allowed here. If you are going to ask a question or to post a solution, describe your algorithm instead. Posting AC code will be penalized.
Post Reply
User avatar
dovier
Posts: 1143
Joined: 8 years ago
Location: Havana, Cuba
Gender: Male
Cuba

1459 - Maximal Lexicographic Rotation

Post by dovier » 7 years ago




Avid
Posts: 4
Joined: 7 years ago
Gender: None specified

Re: 1459 - Maximal Lexicographic Rotation

Post by Avid » 6 years ago

Hi, I was wondering if it would be possible for this problem to implement a correct solution using Suffix Array?

User avatar
ymondelo20
Posts: 1968
Joined: 8 years ago
Location: Universidad de las Ciencias Informáticas
Gender: None specified
Contact:

Re: 1459 - Maximal Lexicographic Rotation

Post by ymondelo20 » 6 years ago

Yes :D
"Every problem has a simple, fast and wrong solution" OJ's Main Law. ;)

enriq
Posts: 1
Joined: 6 years ago
Gender: None specified

Re: 1459 - Maximal Lexicographic Rotation

Post by enriq » 6 years ago

Hi. I have an issue with this problem. I don't understand the example provided. Is supossed that we need two rotations in order to obtain the desired string (lexicographic ordered largest string), but the answer says that is necessary only one rotation :(
Can anyone explain me?

Post Reply

Return to “Problem set”