zoukankan      html  css  js  c++  java
  • HDU3351 Seinfeld 【贪心】

    Seinfeld

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1368    Accepted Submission(s): 674


    Problem 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:
    1. An empty string is stable.
    2. If S is stable, then {S} is also stable.
    3. 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.
    Note: There is a blank space before N.
     

    Sample Input
    }{ {}{}{} {{{} ---
     

    Sample Output
    1. 2 2. 0 3. 1
     

    Source

    题意:给定一个括号序列,求最少经过多少操作能使其变为合法序列。操作仅仅能是把左括号变为右括号或者右括号变为左括号。

    题解:每次读取一个字符,若是左括号。那么left++。若是右括号,那么left--,若left==0,那么须要一次操作以将右括号变为左括号。

    #include <stdio.h>
    #include <string.h>
    
    #define maxn 2010
    
    char str[maxn];
    
    int main() {
    	int i, left, op, cas = 1;
    	while(scanf("%s", str), str[0] != '-') {
    		left = op = 0;
    		for(i = 0; str[i]; ++i) {
    			if(str[i] == '{') ++left;
    			else if(0 == left) {
    				++left; ++op;
    			} else --left;
    		}
    		op += left / 2;
    		printf("%d. %d
    ", cas++, op);
    	}
    	return 0;
    }


  • 相关阅读:
    关于MQ的对比
    关于RabbitMQ(二)
    关于QPS、TPS、并发用户数、吞吐量的关系
    关于使用Ecplise构建gradle项目
    关于记录一次线上真实环境多线程引发的问题
    关于MySQL——find_in_set()函数的使用
    关于数据库的表连接
    关于Java线程池
    IntelliJ搭建Scala及Spark工程
    idea编写wordcount程序及spark-submit运行
  • 原文地址:https://www.cnblogs.com/liguangsunls/p/7277014.html
Copyright © 2011-2022 走看看