coj 1067: 1 VS 1

SHIHAO0711

于 2015-08-14 11:14:19 发布

阅读量511

点赞数

分类专栏： ACM

本文链接：https://blog.youkuaiyun.com/SHIHAO0711/article/details/47623831

版权

ACM 专栏收录该内容

35 篇文章

订阅专栏

#include<stdio.h>
#include<string.h>
//1067
int main()
{
    char a[1005];
    int i;
    while (scanf ("%s", &a) != EOF)
    {
        int length = strlen(a), max = 0, count = 0;
        a[length] = '0';
        for (i = 0;i < length;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;
}