codeforces 837A Text Volume

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

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

0 ·

CC 4.0 BY-SA版权

水题同时被 2 个专栏收录

51 篇文章

订阅专栏

codeforces

38 篇文章

订阅专栏

本文介绍了一个算法问题：如何计算由单个空格分隔的单词组成的文本中最大写字母数量，即文本的体积。通过遍历字符串并统计每个单词中的大写字母数来找到最大值。

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<bits/stdc++.h>
using namespace std;
int main(){
	char a[222];
	int len;
	while(cin>>len)
	{
		getchar();
		gets(a);
		int i,j;
		int ans=0;
		i=0;
		while(i<len)
		{
			int js=0;
			while(a[i]!=' '&&i<len)
			{
				if(a[i]>='A'&&a[i]<='Z')
				js++;
				i++;
			}
			if(js>=ans)ans=js;
			i++;
		}
		cout<<ans<<endl;
	}
	return 0;
}