csu 1067 1vs1

1067: 1 VS 1

Time Limit: 1 Sec Memory Limit: 128 MB
Submit: 31 Solved: 24
[Submit][Status][Web Board]

Description

Alice and Bob are playing the game SanguoSha 1VS1.If Alice take a card or use a card (it may be slash,missed,peach,duel,sabotage or theft and so on) or discard (sometimes he does not need to throw any card) we will write down an uppercase 'A', if Bob does this, of course, we will write down the letter "B'. Tell me the length of the longest operation combo performed by either player.

Input

There are several test cases, each test case contains only a string composed of uppercaser 'A' and 'B'.The input will finish with the end of file.The length of the string is no more than 1000.

Output

. For each the case, output an integer indicate for the length.

Sample Input

AAABBAAAAA
AABBBBAA
AAAAAAAA

Sample Output

5
4
8

HINT

Source

The 2011 7th Hunan University Programming Contest

[Submit][Status][Web Board]
题目思路：                   先遍历字符串，将遍历过程中得到的相同字母的最大长度保存在一个变量里，最后输出。
代码如下：
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>


int main()
{
    char a[1005];
    int i;


    while (scanf ("%s",&a)!=EOF)
    {
        int L;
        int MAX;
        int count;
        L=strlen(a);
        a[L]='0';
        MAX=0;
        count=0;
        for (i=0;i<L;i++)
        {
            if (a[i+1]==a[i])
            {
                count++;
            }
            else
            {
                count++;
                if (count>MAX)
                {
                    MAX=count;
                    count=0;
                }
                else
                {
                    count=0;
                }
            }
        }
        printf ("%d\n",MAX);
    }
    return 0;
}