蓝桥杯算法训练VIP-字串统计 （C++代码）

解题思路:





注意事项:





参考代码:

#include<iostream>
#include<string>
using namespace std;
string s,q;
int main()
{    
int l,i,j,k;    
int max=0;    
cin>>l>>s;    
int len=s.length();    
for(i=l;i<=len;i++)
    {        
for(j=0;j+i<=len;j++)
        {            
         int cnt=0;            
         string s1=s.substr(j,i);            
         for(k=j;k+i<=len;k++)
            {                
         string s2=s.substr(k,i);                
         if(s1==s2)
                    cnt++;
            }            if(cnt>=max)
            {                if(cnt>max)
                {
                    max=cnt;
                    q=s1;
                }                if(cnt==max)
                {                    int l1=q.length();                    
                    int l2=s1.length();                    
                    if(l2>l1)
                        q=s1;
                }
            }
        }
    }    
         cout<<q<<endl;    
         return 0;
 }