这是一道签到水题
http://115.28.76.232/problem?pid=1111
LSS
Time Limit: 20000/10000 MS (Java/Others)
Memory Limit: 128000/64000 KB (Java/Others)
Problem Description
Time flies, four years passed, colleage is over. When I am about to leave, a xuemei ask me an ACM problem, but I can't solve it, I am 功力尽失. Please help me so that I won't lose face in front of xuemei!
Give you a string , you should find the longest substring which is of the same character.
Input
First line there is a T , represents the test cases.
next T lines will be T strings.
the length of every string is less than 100
all the characters of the strings will be lowercase letters
Output
for each test case output a number
Sample Input
1 a
Sample Output
1
测试数据:
2
asdfghkl
aassss
输出:
1
4
<pre name="code" class="cpp">
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int M = 10000+5;
char str[M];
int n;
int ans;
int sum;
int main()
{
cin>>n;
while( n-- )
{
memset(str, 0, sizeof(str));
cin>>str;
ans=0;
sum=1;
for(int i=0; i<strlen(str); i++)
if(str[i]==str[i+1])
{
sum++;
}
else
{
if(ans<sum)
ans=sum;
sum=1;
}
cout<<ans<<endl;
}
return 0;
}