暴力循环判断最小字典序字符串

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h> 

#include<map>
#include<set>
#include<deque>
#include<queue>
#include<stack>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;

#define ll long long
#define da    0x3f3f3f3f
#define xiao -0x3f3f3f3f
#define clean(a,b) memset(a,b,sizeof(a))// 雷打不动的头文件

char chuan[602000];
int n;

int cyc()    //算法
{
	int i=0,j=1,l=strlen(chuan),x,y,cnt=0;
	while(i<l&&j<l&&cnt<l)
	{
		x=i+cnt;
		y=j+cnt;
		if(x>=l)
			x=x-l;
		if(y>=l)
			y=y-l;
		if(chuan[x]==chuan[y])
			cnt++;
		else
		{
			if(chuan[x]>chuan[y])
				i=i+cnt+1;
			else
				j=j+cnt+1;
			cnt=0;
		}
		if(i==j)
			j=j+1;
	}
	return i;
}

int main()
{
	while(cin>>chuan)
	{
		
		int i,j,l=strlen(chuan);
		char ch=chuan[0];
		for(i=0;i<l-1;++i)
		{
			if(chuan[i+1]>=chuan[i])
				chuan[i]=chuan[i+1]-chuan[i]+'0';
			else
				chuan[i]=chuan[i+1]+8-chuan[i]+'0';
		}
		if(ch>=chuan[l-1])
			chuan[l-1]=ch-chuan[l-1]+'0';
		else
			chuan[l-1]=ch+8-chuan[l-1]+'0';
		int str=cyc();
		for(i=l;i<l+str;++i)
			chuan[i]=chuan[i-l];
		for(i=str;i<str+l;++i)
			cout<<chuan[i];
		cout<<endl;
		clean(chuan,'\0');
	}
}