zoukankan      html  css  js  c++  java
  • POJ 3991 Seinfeld

    Seinfeld
    Time Limit: 1000MS Memory Limit: 65536K
    Total Submissions: 1285 Accepted: 599
    Description

    I’m out of stories. For years I’ve been writing stories, some rather silly, just to make simple problems look difficult and complex problems look easy. But, alas, not for this one.
    You’re given a non empty string made in its entirety from opening and closing braces. Your task is to find the minimum number of “operations” needed to make the string stable. The definition for being stable is as follows:

    An empty string is stable.

    If S is stable, then {S} is also stable.

    If S and T are both stable, then ST (the concatenation of the two) is also stable.

    All of these strings are stable: {}, {}{}, and {{}{}}; But none of these: }{, {{}{, nor {}{.
    The only operation allowed on the string is to replace an opening brace with a closing brace, or visa-versa.
    Input

    Your program will be tested on one or more data sets. Each data set is described on a single line. The line is a non-empty string of opening and closing braces and nothing else. No string has more than 2000 braces. All sequences are of even length.
    The last line of the input is made of one or more ’-’ (minus signs.)
    Output

    For each test case, print the following line:
    k. N
    Where k is the test case number (starting at one,) and N is the minimum number of operations needed to convert the given string into a balanced one.
    Sample Input

    }{
    {}{}{}

    {{{}

    Sample Output

    1. 2
    2. 0
    3. 1
    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <iostream>
    #include <algorithm>
    #include <stdio.h>
    
    using namespace std;
    char  a[2005];
    char b[2005];
    int top;
    int main()
    {
        int cas=0;
        while(scanf("%s",a)!=EOF)
        {
            if(a[0]=='-')
                break;
            int len=strlen(a);
            top=-1;
            int ans=0;
            for(int i=0;i<len;i++)
            {
                if(a[i]=='{')
                    b[++top]=a[i];
                else
                {
                    if(top==-1)
                    {
                        b[++top]='{';
                        ans++;
                    }
                    else
                    {
                        if(b[top]=='{')
                            top--;
                    }
                }
            }
            ans+=(top+1)/2;
            printf("%d. %d
    ",++cas,ans);
        }
        return 0;
    }
  • 相关阅读:
    2018/12/08 L1-043 阅览室 Java
    2018/12/08 L1-042 日期格式化 Java
    breeze源码阅读心得
    Spark ML源码分析之四 树
    Spark ML源码分析之三 分类器
    Spark ML源码分析之二 从单机到分布式
    Spark ML源码分析之一 设计框架解读
    Adaboost的意义
    RBM如何训练?
    ChromeTimeline
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228778.html
Copyright © 2011-2022 走看看