CF1214C.Bad Sequence

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Petya's friends made him a birthday present — a bracket sequence. Petya was quite disappointed with his gift, because he dreamed of correct bracket sequence, yet he told his friends nothing about his dreams and decided to fix present himself.

To make everything right, Petya is going to move at most one bracket from its original place in the sequence to any other position. Reversing the bracket (e.g. turning "(" into ")" or vice versa) isn't allowed.

We remind that bracket sequence $s$ is called correct if:

$s$ is empty;
$s$ is equal to "( $t$ )", where $t$ is correct bracket sequence;
$s$ is equal to $t_1 t_2$ , i.e. concatenation of $t_1$ and $t_2$ , where $t_1$ and $t_2$ are correct bracket sequences.

For example, "(()())", "()" are correct, while ")(" and "())" are not. Help Petya to fix his birthday present and understand whether he can move one bracket so that the sequence becomes correct.

输入格式

First of line of input contains a single number $n$ ( $1 \leq n \leq 200\,000$ ) — length of the sequence which Petya received for his birthday.

Second line of the input contains bracket sequence of length $n$ , containing symbols "(" and ")".

输出格式

Print "Yes" if Petya can make his sequence correct moving at most one bracket. Otherwise print "No".

输入输出样例

输入#1
```
2
)(
```
输出#1
```
Yes
```
输入#2
```
3
(()
```
输出#2
```
No
```
输入#3
```
2
()
```
输出#3
```
Yes
```
输入#4
```
10
)))))(((((
```
输出#4
```
No
```

说明/提示

In the first example, Petya can move first bracket to the end, thus turning the sequence into "()", which is correct bracket sequence.

In the second example, there is no way to move at most one bracket so that the sequence becomes correct.

In the third example, the sequence is already correct and there's no need to move brackets.

首页