3 solutions

  • 0
    @ 2025-8-26 15:10:32
    
    #include<bits/stdc++.h>
    using namespace std;
    int main(){
    	//freopen("char.in","r",stdin);
    	//freopen("char.out","w",stdout);
    	char a[100000],b;
    	int c,n,s=1,max1=0;
    	cin>>n;
    	for(int i=1;i<=n;i++){
    		cin>>a[i];
    		c=a[i];
    		if(c-int(a[i-1])==1){
    			s++; 
    		}
    		else{
                if(s>max1){
    			max1=s;
    		}
    			s=1;
    		}
    	}
    	cout<<max1;
    	return 0;
    }
    ```
    
    
    ```
    • 0
      @ 2025-8-26 11:51:26
      
      #include <bits/stdc++.h>
      using namespace std;
      int n, cnt = 1, ans = 1;
      string s;
      int main()
      {
      	cin >> n >> s;
      	for (int i = 1;i < n;i++)
      	{
      		if (s[i] - s[i - 1] == 1)
      		{
      			cnt++;
      		}
      		else
      		{
      			ans = max (ans, cnt);
      			cnt = 1;
      		}
      	}
      	cout << ans;
      	return 0;
      }
      
      • 0
        @ 2025-8-26 9:48:49
        ```cpp
        输入s,n;
        k=1,ans=1;
        循环
        判断是否是连续;
        输出;
        #include<bits/stdc++.h>
        using namespace std;
        int main(){
        int n;
        string s;
        cin>>n;cin>>s;
        int k=1,ans=1;
        for(int i=1;i<n;i++){
          if(s[i]==s[i-1]+1)k++;
        else{
        ans=max(ans,k);k=1;}}
        cout<<ans;
        return 0;}
        
        • 1

        Information

        ID
        1031
        Time
        1000ms
        Memory
        256MiB
        Difficulty
        8
        Tags
        # Submissions
        79
        Accepted
        14
        Uploaded By