CF550E.Brackets in Implications
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
The first line contains integer n ( 1<=n<=100000 ) — the number of arguments in a logical expression.
The second line contains n numbers a1,a2,...,an (), which means the values of arguments in the expression in the order they occur.
输入格式
Print "NO" (without the quotes), if it is impossible to place brackets in the expression so that its value was equal to 0.
Otherwise, print "YES" in the first line and the logical expression with the required arrangement of brackets in the second line.
The expression should only contain characters '0', '1', '-' (character with ASCII code 45), '>' (character with ASCII code 62), '(' and ')'. Characters '-' and '>' can occur in an expression only paired like that: ("->") and represent implication. The total number of logical arguments (i.e. digits '0' and '1') in the expression must be equal to n . The order in which the digits follow in the expression from left to right must coincide with a1,a2,...,an .
The expression should be correct. More formally, a correct expression is determined as follows:
- Expressions " 0 ", " 1 " (without the quotes) are correct.
- If v1 , v2 are correct, then v1 -> v2 is a correct expression.
- If v is a correct expression, then (v) is a correct expression.
The total number of characters in the resulting expression mustn't exceed 106 .
If there are multiple possible answers, you are allowed to print any of them.
输出格式
无
输入输出样例
输入#1
4 0 1 1 0
输出#1
YES (((0)->1)->(1->0))
输入#2
2 1 1
输出#2
NO
输入#3
1 0
输出#3
YES 0