前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >Codefoces 723B Text Document Analysis

Codefoces 723B Text Document Analysis

作者头像
Angel_Kitty
发布2018-04-08 14:22:25
6980
发布2018-04-08 14:22:25
举报
文章被收录于专栏:小樱的经验随笔

B. Text Document Analysis

time limit per test:1 second

memory limit per test:256 megabytes

input:standard input

output:standard output

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

代码语言:javascript
复制
37

_Hello_Vasya(and_Petya)__bye_(and_OK)

Output

代码语言:javascript
复制
5 4

Input

代码语言:javascript
复制
37

_a_(_b___c)__de_f(g_)__h__i(j_k_l)m__

Output

代码语言:javascript
复制
2 6

Input

代码语言:javascript
复制
27

(LoooonG)__shOrt__(LoooonG)

Output

代码语言:javascript
复制
5 2

Input

代码语言:javascript
复制
5

(___)

Output

代码语言:javascript
复制
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.

题目链接:http://codeforces.com/problemset/problem/723/B

正解:模拟

解题报告:

直接模拟,注意处理字符串的计数器的诸多情况,有一点细节。

下面给出AC代码:

代码语言:javascript
复制
 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 int main()
 4 {
 5     char s[10000];
 6     int n,len=0,s1 = 0,s2 = 0;
 7     bool flag = 0;
 8     while(scanf("%d%s",&n,&s)!=EOF)
 9     {
10         //for(int i=0;i<n;i++)
11             //scanf("%c",&s[i]);
12             for(int j = 0; j < n; j++)
13              {
14         if(s[j] == '(') flag=1;
15         if(s[j] == ')') flag=0;
16         if((s[j] >= 'a' && s[j] <= 'z') || (s[j] >= 'A' && s[j] <= 'Z')) {
17             len++;
18         }
19         else len = 0;
20         if(!flag) s1=max(s1, len);
21         else if(len==1)s2++;
22     }
23     printf("%d %d\n", s1,s2);
24 }
25 return 0;
26 }
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2017-03-06 ,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档