codeforce-Text Document Analysis

最新推荐文章于 2023-09-11 09:12:46 发布

RTFIL

最新推荐文章于 2023-09-11 09:12:46 发布

阅读量171

点赞数

CC 4.0 BY-SA版权

分类专栏： # codeforces

本文链接：https://blog.youkuaiyun.com/qq_43516113/article/details/95976287

codeforces 专栏收录该内容

38 篇文章

订阅专栏

本文介绍了一个简单的程序，该程序能够统计给定字符串中单词的相关信息，包括最长单词的长度（位于括号外）及括号内的单词总数。通过遍历字符串并利用条件判断来区分不同的字符类型，最终输出所需的统计数据。

我是题目

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:

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 <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    string s;
    cin >> n >> s;
    int out = 0;
    int in = 0;
    for (int i = 0; i < n; i++)
    {
        if (s[i] == '_')
        {
            continue;
        }
        if (isalpha(s[i]))
        {
            int t = 0;
            while (isalpha(s[i]) && i < n)
            {
                i++;
                t++;
            }
            out = max(out, t);
        }
        if (s[i] == '(')
        {
            while (s[i] != ')' && i < n)
            {
                if (isalpha(s[i]))
                {
                    while (isalpha(s[i]) && i < n)
                    {
                        i++;
                    }
                    in++;
                }
                else
                {
                    i++;
                    continue;
                }
            }
        }
    }
    cout << out<< " " << in<< endl;
    return 0;
}