CodeForces 723B Text Document Analysis

Posted 2020-08-31

模拟。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<ctime>
#include<iostream>
using namespace std;
typedef long long LL;
const double pi=acos(-1.0),eps=1e-10;
void File()
{
    freopen("D:\\in.txt","r",stdin);
    freopen("D:\\out.txt","w",stdout);
}
template <class T>
inline void read(T &x)
{
    char c = getchar();
    x = 0;
    while(!isdigit(c)) c = getchar();
    while(isdigit(c))
    {
        x = x * 10 + c - ‘0‘;
        c = getchar();
    }
}

char s[300];
int n,a,b,f,len;

int main()
{
    cin>>n;
    cin>>s; a=b=f=len=0;
    for(int i=0;s[i];i++)
    {
        if(s[i]==‘_‘)
        {
            if(len==0) continue;
            if(f==0) a=max(a,len);
            if(f==1) b++;
            len=0;
        }
        else if(s[i]==‘(‘)
        {
            f=1;
            if(len==0) continue;
            a=max(a,len);
            len=0;

        }
        else if(s[i]==‘)‘)
        {
            f=0;
            if(len==0) continue;
            b++;
            len=0;
        }
        else
        {
            len++;
        }
    }

    if(len!=0)
    {
        if(f==0) a=max(a,len);
        if(f==1) b++;
        len=0;
    }

    cout<<a<<" "<<b<<endl;

    return 0;
}