31:字符串中最长的连续出现的字符

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<queue>
 4 #include<cmath>
 5 #include<cstring>
 6 using namespace std;
 7 char a[10001];
 8 int now;
 9 int maxn=-1;
10 char ans;
11 int main() 
12 {
13     gets(a);
14     int l=strlen(a);
15     for(int i=0;i<l;i++)
16     {
17         if(a[i]==a[i+1])
18         now++;
19         else
20         {
21             now++;
22             if(now>maxn)
23             {
24                 maxn=now;
25                 ans=a[i];
26             }
27             now=0;    
28         }
29     }
30     cout<<ans<<" "<<maxn;
31     return 0;
32 }