zoukankan      html  css  js  c++  java
  • Educational Codeforces Round 26 Problem A

    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.

     题目大意:输出所给字符串中大写字符最多的数量

    输入输出的入门题。

     1 #include<iostream>
     2 #include<stdio.h>
     3 using namespace std;
     4 int main(){
     5     int n;
     6     char a[300];
     7     cin>>n;
     8     char c;
     9     c=getchar();
    10     gets(a);
    11     int mx=0;
    12     for(int i=0;i<n;i++){
    13         int tmp=0;
    14         while(a[i]!=' '&&i<n){
    15             if(a[i]>='A'&&a[i]<='Z'){
    16                 tmp++;
    17             }
    18             i++;
    19         }
    20         mx=max(mx,tmp);
    21     }
    22     cout<<mx<<endl;
    23     return 0;
    24 }
  • 相关阅读:
    oracle基础~ash报告管理
    django基础-bootstarp
    django基础~admin入门
    django基础~jquery交互
    oracle基础~RAC-grid搭建
    Oracle基础~RAC搭建准备二
    oracle基础~RAC搭建准备一
    oracle基础~补丁安装
    环境准备、框架认识、新建maven项目和配置tomcat
    python线程问题、深浅拷贝、属性动态设置
  • 原文地址:https://www.cnblogs.com/ISGuXing/p/7284997.html
Copyright © 2011-2022 走看看