3016: [Usaco2012 Nov]Clumsy Cows

最新推荐文章于 2024-06-21 18:37:16 发布

CRZbulabula

最新推荐文章于 2024-06-21 18:37:16 发布

阅读量309

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/CRZbulabula/article/details/52167872

版权

贪心专栏收录该内容

50 篇文章 0 订阅

订阅专栏

3016: [Usaco2012 Nov]Clumsy Cows

Time Limit: 1 Sec Memory Limit: 128 MB
Submit: 151 Solved: 119
[ Submit][ Status][ Discuss]

Description

Bessie the cow is trying to type a balanced string of parentheses into her new laptop, but she is sufficiently clumsy (due to her large hooves) that she keeps mis-typing characters. Please help her by computing the minimum number of characters in the string that one must reverse (e.g., changing a left parenthesis to a right parenthesis, or vice versa) so that the string would become balanced. There are several ways to define what it means for a string of parentheses to be "balanced". Perhaps the simplest definition is that there must be the same total number of ('s and )'s, and for any prefix of the string, there must be at least as many ('s as )'s. For example, the following strings are all balanced:

()

(())

()(()())

while these are not:

)(

())(

((())))

问题描述

给定长度为n的一个括号序列，每次修改可以修改一个位置的括号，若这个括号为’(‘，则修改为’)’，若这个括号为’)’，则修改为’(‘，问最少修改多少个使得原括号序列合法。

其中：

① ()是合法的；

② 若A是合法的，则(A)是合法的；

③ 若A，B都是合法的，则AB是合法的。

Input

一个长度为n个括号序列。

Output

最少的修改次数。

Sample Input

())(

Sample Output

2

样例说明
修改为()()，其中红色部分表示修改的括号。

数据范围
100%的数据满足：1 <= n <= 100,000。

HINT

Source

Silver

[ Submit][ Status][ Discuss]

瞎逼贪心 左括号记为1右括号记为-1 括号序列合法，必须前缀和始终>=0并且在最后一个位置 = 0 读入后统计每个位置前缀和 如果当前位置<0，则要把这个右括号改成左括号，前缀和+=2 最后如果前缀和大于零再把多出来的一半左括号改成右括号

#include<iostream>
#include<cstdio>
#include<queue>
#include<vector>
#include<bitset>
#include<algorithm>
#include<cstring>
#include<map>
#include<stack>
#include<set>
#include<cmath>
#include<ext/pb_ds/priority_queue.hpp>
using namespace std;

const int maxn = 1E5 + 10;

int sum,ans,len;
char ch[maxn];

int main()
{
	#ifdef DMC
		freopen("DMC.txt","r",stdin);
	#endif
	
	scanf("%s",ch);
	len = strlen(ch);
	for (int i = 0; i < len; i++) {
		if (ch[i] == '(') ++sum;
		else --sum;
		if (sum < 0) ++ans,sum += 2;
	}
	ans += sum>>1;
	cout << ans;
	return 0;
}