ANARC09A  Seinfeld
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 visaversa.
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 nonempty 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.
Example
Input: }{
{}{}{}
{{{}

Output: 1. 2
2. 0
3. 1
hide comments
akt_1998:
20161019 16:38:07
sas #pr0_/\_


sas1905:
20161012 21:53:26
Easy..!!No need of dp..!!Done using both stack approach and adhoc approach..:) Last edit: 20161012 21:56:58 

lalywr:
20161012 19:43:18
Was getting WAs :( but then wore Apoorv Gaurav Singh's 4k wala Tshirt . Finally AC :D 

herkeyrefugee:
20160920 13:28:06
Last edit: 20160920 14:30:48 

tana_konda:
20160918 09:41:28
I used a stack b/c that's how my mind worked and it didn't time out lol. 

hamjosh1:
20160917 16:55:24
Be careful of the output format caused me 2 wa :'( 

davidgalehouse:
20160914 04:52:56
This problem is hard for people who don't read the comments, because you try to use DP... I could only think of an O(n^3) DP solution but I figure you need O(n^2) so I gave up and read the comments. But I used it to verify my greedy solution. And I don't think the greedy solution is as simple as everyone says, plus is anyone proving optimality? Can someone teach me the DP solution and prove optimality for the greedy? Thank YOU!!! 

ajeyo:
20160908 16:24:39
No DP! No Stacks! the tag should be rather changed to AdHoc!! 

cubalgo:
20160822 17:10:53
WA's due to getline . 

jasbir_220b2:
20160813 18:41:01
O(n) without stack .... no need of DP ..happy coding :) 
Added by:  Mohammad Kotb 
Date:  20091128 
Time limit:  3.236s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 BASH JSRHINO 
Resource:  http://www.icpcanarc.org 