seinfeld专题

HDU3351_Seinfeld【栈】

Seinfeld Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1381    Accepted Submission(s): 682 Problem Description I’m o

hdu 3351 Seinfeld / poj 3991 括号匹配2

题意:给出一个由'{' , '}' 组成的字符串,通过改变最少括号的方向使其匹配。 思路:一开始用区间dp,TLE了,贪心才能过。贪心方法:从左向右遍历,遇到左括号lef++,遇到右括号,若lef>0,lef--,否则右括号变为左括号,ans++,lef++,最后再加上多下来的左括号,即lef/2。   先给出TLE代码: #include<cstdio>#include<cstring

hdu 3351 Seinfeld(栈操作)

Seinfeld Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2037    Accepted Submission(s): 983 Problem Description I’m out of storie

hdoj 3351 Seinfeld 【栈的简单应用】

Seinfeld Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1373    Accepted Submission(s): 678 Problem Description I’m o