Codeforces Round #375 (Div. 2)B. Text Document Analysis

B. Text Document Analysis
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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.

奥妙重重的题目，不太矫揉造作的送分
线性扫描
时间复杂度：O（玄学） O(n)

#include<cstdio>
//我写的果然乱七八糟
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
using namespace std;
int n,khw[105],khwn=0,khnn=0,s,i;
int main()
{
    bool khn=0;
    char c;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>c;
        if(c=='(')
            khn=1;
        if(c==')')
            khn=0;
        if(c>='a'&&c<='z'||c>='A'&&c<='Z')
        {
            if(khn)
            {
                while(1)
                {
                    if(i>=n)
                    {
                        khnn++;
                        break;
                    }
                    cin>>c;
                    i++;
                    if(c=='_')
                    {
                        khnn++;
                        break;
                    }
                    if(c==')')
                    {
                        khnn++;
                        khn=0;
                        break;
                    }
                }
            }
            else
            {
                s=1;
                while(1)
                {
                    if(i>=n)
                    {
                        khwn++;
                        khw[khwn]=s;
                        break;
                    }
                    cin>>c;
                    i++;
                    if(c=='_')
                    {
                        khwn++;
                        khw[khwn]=s;
                        break;
                    }
                    if(c=='(')
                    {
                        khwn++;
                        khw[khwn]=s;
                        khn=1;
                        break;
                    }
                    s++;
                }
            }
        }
    }
    if(khwn==0)
        cout<<0<<" "<<khnn;
    else
    {
        sort(khw+1,khw+khwn+1);
        cout<<khw[khwn]<<" "<<khnn;
    }
    return 0;
}