zoukankan      html  css  js  c++  java
  • cf723b Text Document Analysis

    Modern text editors usually show some information regarding the document being edited. For example, the number of words, the number of pages, or the number of characters.

    In this problem you should implement the similar functionality.

    You are given a string which only consists of:

    • uppercase and lowercase English letters,
    • underscore symbols (they are used as separators),
    • parentheses (both opening and closing).

    It is guaranteed that each opening parenthesis has a succeeding closing parenthesis. Similarly, each closing parentheses has a preceding opening parentheses matching it. For each pair of matching parentheses there are no other parenthesis between them. In other words, each parenthesis in the string belongs to a matching "opening-closing" pair, and such pairs can't be nested.

    For example, the following string is valid: "_Hello_Vasya(and_Petya)__bye_(and_OK)".

    Word is a maximal sequence of consecutive letters, i.e. such sequence that the first character to the left and the first character to the right of it is an underscore, a parenthesis, or it just does not exist. For example, the string above consists of seven words: "Hello", "Vasya", "and", "Petya", "bye", "and" and "OK". Write a program that finds:

    • the length of the longest word outside the parentheses (print 0, if there is no word outside the parentheses),
    • the number of words inside the parentheses (print 0, if there is no word inside the parentheses).
    Input

    The first line of the input contains a single integer n (1 ≤ n ≤ 255) — the length of the given string. The second line contains the string consisting of only lowercase and uppercase English letters, parentheses and underscore symbols.

    Output

    Print two space-separated integers:

    • the length of the longest word outside the parentheses (print 0, if there is no word outside the parentheses),
    • the number of words inside the parentheses (print 0, if there is no word inside the parentheses).
    Examples
    input
    37
    _Hello_Vasya(and_Petya)__bye_(and_OK)
    output
    5 4


    input
    37
    _a_(_b___c)__de_f(g_)__h__i(j_k_l)m__
    output
    2 6


    input
    27
    (LoooonG)__shOrt__(LoooonG)
    output
    5 2


    input
    5
    (___)
    output
    0 0


    Note

    In the first sample, the words "Hello", "Vasya" and "bye" are outside any of the parentheses, and the words "and", "Petya", "and" and "OK" are inside. Note, that the word "and" is given twice and you should count it twice in the answer.

    /*
    就是让你统计括号外最长串和括号内单词数
    */
    #include<iostream>
    #include<cstdio>
    #include<string>
    #include<cstring>
    #include<cmath>
    #include<algorithm>
    using namespace std;
    char cmd,s[550];
    bool j;
    int cnt,ans1,ans2,n;
    int main(){
        cin>>n;
        scanf("%s",s+1);
        j = false;
        cnt = 0;
        for(int i = 1;i <= n;i++){
            if(s[i] == '_' || s[i] == '(' || s[i] == ')'){
                if(cnt){
                    if(!j)ans1 = max(cnt,ans1);
                    cnt = 0;
                    if(j) ans2++;
                }
            }
            if(s[i] == '(') j = true;
            if(s[i] == ')') j = false;
            if(s[i] != '_' && s[i] != '(' && s[i] != ')') cnt++;
        }
        if(cnt){
            if(!j)ans1 = max(cnt,ans1);
            cnt = 0;
            if(j) ans2++;
        }
        cout<<ans1<<" "<<ans2;
        return 0;
    }
  • 相关阅读:
    JavaScript常见注意点(一)
    jspServlet2.5和Servlet3的区别
    jspMVC案例
    jQuery入口函数的写法
    Servlet 简介
    jspMVC设计模式和Servlet2.5入门案例
    display 属性
    JSON简单使用
    Tomcat修改端口号
    php开发环境简单配置
  • 原文地址:https://www.cnblogs.com/hyfer/p/5929947.html
Copyright © 2011-2022 走看看