CF #551 (Div. 2) C Serval and Parenthesis【贪心】

最新推荐文章于 2019-04-26 17:09:12 发布

zhmeng_

最新推荐文章于 2019-04-26 17:09:12 发布

阅读量189

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/qq_43482299/article/details/89310511

版权

一道关于正确括号序列的数学问题，要求替换字符串中的问号，使得所有严格前缀不是正确括号序列，而整个序列是。采用贪心策略，根据需要的'('和')'数量来替换问号。

摘要由CSDN通过智能技术生成

C. Serval and Parenthesis Sequence

1s / 256 megabytes

题目描述

Serval soon said goodbye to Japari kindergarten, and began his life in Japari Primary School.
In his favorite math class, the teacher taught him the following interesting definitions.

A parenthesis sequence is a string, containing only characters “(” and “)”.

A correct parenthesis sequence is a parenthesis sequence that can be transformed into a correct arithmetic expression by inserting characters “1” and “+” between the original characters of the sequence. For example, parenthesis sequences “()()”, “(())” are correct (the resulting expressions are: “(1+1)+(1+1)”, “((1+1)+1)”), while “)(” and “)” are not. Note that the empty string is a correct parenthesis sequence by definition.

We define that |s| as the length of string s. A strict prefix s[1…l] (1≤l<|s|) of a string s=s1s2…s|s| is string s1s2…sl. Note that the empty string and the whole string are not strict prefixes of any string by the definition.

Having learned these definitions, he comes up with a new problem. He writes down a string s containing only characters “(”, “)” and “?”. And what he is going to do, is to replace each of the “?” in s independently by one of “(” and “)” to make all strict prefixes of the new sequence not a correct parenthesis sequence, while the new sequence should be a correct parenthesis sequence.

After all, he is just a primary school student so this problem is too hard for him to solve. As his best friend, can you help him to replace the question marks? If there are many solutions, any of them is acceptable.

数据规模：

对于30％的数据，保证有n<=1000；
对于50％的数据，保证有n<=5000；
对于全部的数据，保证有n<=10000。

Input

The first line contains a single integer |s| (1≤|s|≤3⋅105), the length of the string.
The second line contains a string s, containing only “(”, “)” and “?”.**

Output

A single line contains a string representing the answer.
If there are many solutions, any of them is acceptable.
If there is no answer, print a single line containing " ? " (with