最小表示法
字符串最小表示法
int getPos(string s,int op)//zero represent the least representation, while one represent the largest
{
int i=0,j=1;
int len=s.size();
while (i=len) break;
if ((s[(i+k)%len] int getPos(string s,int op)//zero represent the least representation, while one represent the largest
{
int i=0,j=1;
int len=s.size();
while (i=len) break;
if ((s[(i+k)%len]