求一个字符串中连续出现次数最多的子串

//求一个字符串中连续出现次数最多的子串
pair<int, string> fun(const string &str)
{
int maxcount = 1, count = 1;
string substr;
int i =0, j = 0;
int len = str.length();
int k = i + 1;
while (i < len){
j = str.find(str[i], k);//从k开始寻找str[i]
cout << "j:" << j<<endl;

if (j == string::npos || j>(len + i) / 2){//因为寻找的是连续子串，所以不能超过i与len的中间位置（保证剩余长度大于等于检索过子串的长度）

i++;
k = i + 1;
}


else{
int s = i;
int sl = j - i;
while ( str.substr(s, sl) == str.substr(j, sl)){
count++;
s = j;
j = j + sl;
}
if (count > maxcount){
maxcount = count;
substr = str.substr(i, sl);
}


i++; //归位
k = i + 1;
count = 1;
}
}


return make_pair(maxcount,substr);
}




int main()
{
string str;
pair<int, string> rs;
while (cin >> str){
rs = fun(str);
cout <<"str:"<< rs.second<< ":" << rs.first << endl;
}


system("pause");
return 0;
}