2 solutions

  • 8
    @ 2024-6-22 14:00:23
    #include<bits/stdc++.h>
    using namespace std;
    const int N=1010;
    char s[N];
    int main()
    {
        cin.getline(s,N);
        int n=strlen(s);
        for(int i=0;i<n;i++)
        {
            int j=i;
            while(j<n&&s[i]==s[j]) j++;
            j--;
            int len=j-i+1;
            cout<<len<<s[i];
            i=j; 
        }
        return 0;
    }****
    
    • 0
      @ 2026-5-10 9:24:59
      #include<bits/stdc++.h>
      using namespace std;
      int main()
      {
      	int l;
      	string s;
      	cin>>l>>s; 
      	string res;
      	int maxv=0;
      	for(int i=l;i<=s.size();i++) //枚举长度
      	{
      		for(int j=0;j+i-1<s.size();i++) //枚举起点
      		{
      			string s1=s.substr(j,i);
      			int cnt=0;
      			for(int k=j;k+i-1<s.size();k++) //枚举起点
      			{
      				string s2=s.substr(k,i);
      				if(s1==s2)
      				{
      					cnt++;
      				}
      			}	
      			if(cnt>maxv||cnt==maxv&&s1.size()>res.size())
      			{
      				maxv=cnt;
      				res=s1;
      			}
      		}	
      	} 
      	cout<<res;
      	return 0;
      }
      
      
      • 1

      Information

      ID
      923
      Time
      1000ms
      Memory
      256MiB
      Difficulty
      1
      Tags
      (None)
      # Submissions
      72
      Accepted
      32
      Uploaded By