标签：
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:
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 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.
Print two space-separated integers:
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
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.
1 //It is made by jump~ 2 #include <iostream> 3 #include <cstdlib> 4 #include <cstring> 5 #include <cstdio> 6 #include <cmath> 7 #include <algorithm> 8 #include <ctime> 9 #include <vector> 10 #include <queue> 11 #include <map> 12 #include <set> 13 using namespace std; 14 typedef long long LL; 15 const int inf = (1<<30); 16 int n,ans,ans2,cnt2; 17 char ch[256]; 18 19 inline int getint() 20 { 21 int w=0,q=0; char c=getchar(); 22 while((c<‘0‘ || c>‘9‘) && c!=‘-‘) c=getchar(); if(c==‘-‘) q=1,c=getchar(); 23 while (c>=‘0‘ && c<=‘9‘) w=w*10+c-‘0‘, c=getchar(); return q ? -w : w; 24 } 25 26 inline void work(){ 27 n=getint(); scanf("%s",ch); int now,cnt; 28 for(int i=0;i<n;i++) { 29 if(ch[i]==‘(‘) { 30 ans=max(ans,cnt2); cnt2=0; 31 now=i+1; cnt=0; 32 while(ch[now]!=‘)‘) { 33 if(ch[now]==‘_‘) { 34 if(cnt!=0) ans2++; 35 cnt=0; 36 } 37 else cnt++; 38 now++; 39 } 40 if(cnt!=0) cnt=0,ans2++; 41 i=now; 42 } 43 else{ 44 if(ch[i]==‘_‘) { 45 if(cnt2!=0) ans=max(cnt2,ans); 46 cnt2=0; 47 } 48 else cnt2++; 49 } 50 } 51 if(cnt2!=0) ans=max(ans,cnt2); 52 printf("%d %d",ans,ans2); 53 } 54 55 int main() 56 { 57 work(); 58 return 0; 59 }
codeforces 723B：Text Document Analysis
标签：
原文地址：http://www.cnblogs.com/ljh2000-jump/p/5933846.html
