Codefoces 723B Text Document Analysis

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

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.

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

正解:模拟

解题报告:

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

下面给出AC代码:

 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 }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏计算机视觉与深度学习基础

Leetcode 154 Find Minimum in Rotated Sorted Array II

Follow up for "Find Minimum in Rotated Sorted Array": What if duplicates are a...

1856
来自专栏Python小白进阶之旅

Python面试必备,看完轻轻松松拿到10k

平时我们几乎不可能用到的东西,像那些类里面的魔法方法,你还记得几个,这些可都是面试必备啊~

4188
来自专栏Android知识点总结

写一个自定义控件attrs自动生成代码工具

894
来自专栏技术碎碎念

LeetCode-1- Two Sum

Given an array of integers, return indices of the two numbers such that they add...

2938
来自专栏移动端开发

内存管理说明白点

1392
来自专栏cloudskyme

设计模式(3)-装扮你的类(装饰模式)

首先看看书上的例子吧!人穿衣服的例子! 类图就不画了,就是简单的类结构。 代码如下: #include <iostream> using namespace ...

2615
来自专栏北京马哥教育

文本过滤之grep,egreo及fgrep 三剑客及正则表达式

关于grep,egrep以及fgrep,是我们linux服务器中常用的文本过滤工具。掌握好这三个工具并结合正则表达式,对我们日后的运维工作有很大的帮助。 1.g...

2773
来自专栏idba

了解Python装饰器

一 装饰器是什么 装饰器是一个用于封装函数或者类的代码工具,显式地将封装器作用于函数或者类上,达到程序运行时动态增加功能的目的。对于函数运行前处理常见前置条件...

986
来自专栏互联网杂技

28个JavaScript 编程黑科技:还有这种操作!

从来不需要声明一个变量的值是undefined,因为JavaScript会自动把一个未赋值的变量置为undefined。所有如果你在代码里这么写,会被鄙视的

1203
来自专栏轻扬小栈

[半zz]迅雷笔试题

1663

扫码关注云+社区