Poj 1509 glass beads (minimum string representation)

Question link: http://poj.org/problem? Id = 1509

This topic is initially thought to be a suffix array, concatenate the same string, and then calculate the rank.

I did not expect suchAlgorithm, You can directly find the minimum representation of the string. I learned it, but it is not very profound.

This algorithm is easy to implement. If it is understood as this, remember it. It is better to understand it.

But if you really want to get stuck with the details, you can still get around!

 # include 
  
    # include 
   
     # include 
    
      using namespace STD; # define maxn 210000 char STR [maxn]; int N; int get_min (char * Name, int Len) {int I = 0, j = 1, k = 0; int t; while (I 
     
       0) I = I + k + 1; else J = J + k + 1; if (I = J) // if K is added, this situation may occur. j ++; k = 0 ;}} return I