Codeforces Round #375 Text Document Analysis
来源:互联网 发布:js urldecode gbk 编辑:程序博客网 时间:2024/06/01 09:01
Description
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).
Sample Input
37_Hello_Vasya(and_Petya)__bye_(and_OK)
5 4
37_a_(_b___c)__de_f(g_)__h__i(j_k_l)m__
2 6
27(LoooonG)__shOrt__(LoooonG)
5 2
5(___)
0 0
Hint
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<stdio.h>#include<string.h>#include<ctype.h>#include<algorithm>using namespace std;char a[260];int main(){ int n,i,maxn=0,cnt=0; scanf("%d %s",&n,a); for(i=0;i<n;i++) { if(a[i]=='_') continue; if(isalpha(a[i])) { int j=0; while(isalpha(a[i])&&i<n) { i++; j++; } maxn=max(maxn,j); } if(a[i]=='(') { i++; while(a[i]!=')') { if(a[i]=='_') { i++; continue; } while(isalpha(a[i])) i++; cnt++; } } } printf("%d %d\n",maxn,cnt); return 0;}
- Text Document Analysis Codeforces Round#375-B
- Codeforces Round #375 Text Document Analysis
- Codeforces Round #375 (Div. 2)B. Text Document Analysis
- Codeforces Round #375 (Div. 2)B. Text Document Analysis
- 【Codeforces Round 375 (Div 2) B】【水模拟】Text Document Analysis
- Codeforces Round #375 (Div. 2) B.Text Document Analysis(分类暴力)
- Codeforces Round #375 (Div. 2) B. Text Document Analysis(字符串处理,简单题目)
- [codeforces] B. Text Document Analysis 字符分析
- 【44.10%】【codeforces 723B】Text Document Analysis
- Codeforces 723 B. Text Document Analysis
- Codeforces 723B Text Document Analysis
- CodeForces 723B Text Document Analysis
- Codeforces 723B-Text Document Analysis
- Codeforces #375(Div.2)B.Text Document Analysis【模拟】水题
- Codeforces 723B Text Document Analysis (字符串处理)
- CodeForces 723B Text Document Analysis(字符串的分析)
- CodeForces 723B-Text Document Analysis(模拟)
- Text Document Analysis
- ERROR 1819 (HY000): Your password does not satisfy the current policy requirements
- ShareSDK社会化分享之那些年我们踩过的坑
- 形象易懂的观察者模式
- java-list运用
- Visual Studio Code 使用 Typings 实现智能提示功能
- Codeforces Round #375 Text Document Analysis
- mybatis入门
- Html的基本知识
- 常用的Mysql数据库操作语句大全
- Unity 入门总结 Monobehaviour 类
- Java从零开始(二)——Java关键字
- 高效显示Bitmap之缓存Bitmap
- Android QQi (qq国际版本)的授权登录与分享
- Matlab的图像操作——colorbar的各项细节操作