codeforces 837A Text Volume

最新推荐文章于 2024-08-01 17:45:36 发布

原创最新推荐文章于 2024-08-01 17:45:36 发布 · 450 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#水题

ACM算法_水题专栏收录该内容

76 篇文章

订阅专栏

本文介绍了一个简单的算法，用于计算由空格分隔的单词组成的文本中每个单词的大写字母数量，并找出这些单词中大写字母的最大数量，即文本的体积。

点击打开链接

A. Text Volume

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a text of single-space separated words, consisting of small and capital Latin letters.

Volume of the word is number of capital letters in the word. Volume of the text is maximum volume of all words in the text.

Calculate the volume of the given text.

Input

The first line contains one integer number n (1 ≤ n ≤ 200) — length of the text.

The second line contains text of single-space separated words s1, s2, ..., si, consisting only of small and capital Latin letters.

Output

Print one integer number — volume of text.

        Examples
      
          input
        
7
NonZERO

          output
        
5

          input
        
24
this is zero answer text

          output
        
0

          input
        
24
Harbour Space University

          output
        
1

Note

In the first example there is only one word, there are 5 capital letters in it.

In the second example all of the words contain 0 capital letters.

水题

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    char s[200];
    int m=0,x,n;
    scanf("%d",&n);
    while(~scanf("%s",s))
    {
        x=0;
        int len=strlen(s);
        for(int i=0;i<len;i++)
        {
            if(s[i]>='A'&&s[i]<='Z')
                x++;
        }
        m=max(m,x);
    }
    printf("%d\n",m);
    return 0;
}