Codeforces 1322 A. Unusual Competitions

题意：

给出一个含有 ()( )() 的字符串，让你可以选择一个区间进行重新排序，问一共选择的区间长度是多少可以使得字符串最后变成 "(())()","()""(())()", "()""(())()","()" 这种形式。

我们只需要从头开始遍历然后找到 ))) 这种字符，并且使得 ((( 和 ))) 的数量相等，然后把这个区间重新排序即可。

AC代码：

int n, m, p;
int ans, res, pos;
const int N = 1e6 + 5;
char s[N];
int main()
{sd(n);ss(s + 1);int sum = 0;pos = -1;ans = 0;rep(i, 1, n){if (s[i] == '(')sum++;elsesum--;if (sum < 0 && pos == -1)pos = i;if (pos != -1 && !sum)ans += i - pos + 1, pos = -1;}if (sum != 0)puts("-1");elsepd(ans);return 0;
}

Codeforces 1322 A. Unusual Competitions相关推荐

CodeForces - 1323 C Unusual Competitions
一.内容 A bracketed sequence is called correct (regular) if by inserting "+" and "1" ...
Codeforces Round #626 (Div. 2, based on Moscow Open Olympiad in Informatics)C. Unusual Competitions
C. Unusual Competitions time limit per test1 second memory limit per test512 megabytes inputstandard ...
Unusual Competitions
Unusual Competitions A bracketed sequence is called correct (regular) if by inserting "+" ...
A. Unusual Competitions
滴答滴答---题目链接 A. Unusual Competitions time limit per test 1 second memory limit per test 512 megabytes ...
CodeForces - 1323C Unusual Competitions(贪心)
题目链接:点击查看题目大意:给出一个长度为 n 的括号序列,现在允许的操作是对于一段区间 [ l , r ] 内的括号重新排列,所需要的花费为区间长度,问如果想要使得括号序列变为正确的形式,最少花费 ...
Unusual Competitions CodeForces - 1323C（思维）
A bracketed sequence is called correct (regular) if by inserting "+" and "1" you ...
C. Unusual Competitions
链接:https://codeforces.ml/contest/1323/problem/C A bracketed sequence is called correct (regular) if ...
1322A. Unusual Competitions · 括号
题解题意: 括号匹配,给一段括号,可以选择一段区间[l,r][l,r][l,r],交换其内部括号的位置使得这一段区间的括号是匹配的,代价是区间长度,问要使整个区间都是匹配的最小代价是多少官方题解: ...
Codeforces Round #626（Div.2）解题报告
Codeforces Round #626 (Div. 2, based on Moscow Open Olympiad in Informatics) [前言] 最近沉迷只狼,好久没有打CF了,水平 ...

Codeforces 1322 A. Unusual Competitions

题意：

AC代码：

Codeforces 1322 A. Unusual Competitions相关推荐

最新文章

热门文章