CF1461F.Mathematical Expression

省选/NOI-

通过率:0%

时间限制:1.00s

内存限制:256MB

AC君温馨提醒

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

题目描述

Barbara was late for her math class so as a punishment the teacher made her solve the task on a sheet of paper. Barbara looked at the sheet of paper and only saw nn numbers a1,a2,…,ana_1, a_2, \ldots, a_n without any mathematical symbols. The teacher explained to Barbara that she has to place the available symbols between the numbers in a way that would make the resulting expression's value as large as possible. To find out which symbols were available the teacher has given Barbara a string ss which contained that information.

It's easy to notice that Barbara has to place n−1n - 1 symbols between numbers in total. The expression must start with a number and all symbols must be allowed (i.e. included in ss). Note that multiplication takes precedence over addition or subtraction, addition and subtraction have the same priority and performed from left to right. Help Barbara and create the required expression!

芭芭拉数学课迟到了,作为惩罚,老师让她在一张纸上完成一道题目。芭芭拉看到纸上只有 nn 个数字 a1,a2,…,ana_1, a_2, \ldots, a_n,中间没有任何数学符号。老师向芭芭拉解释道:她必须在这些数字之间填入可用的运算符,使得最终表达式的值尽可能大。为了说明哪些运算符是可用的,老师给了芭芭拉一个字符串 ss,其中包含了所有可用运算符的信息。

容易注意到,芭芭拉总共需要在数字之间填入 n−1n - 1 个运算符。表达式必须以一个数字开头,且所有填入的运算符都必须是允许的(即必须出现在字符串 ss 中)。注意:乘法优先级高于加法和减法;加法与减法优先级相同,按从左到右的顺序计算。请帮助芭芭拉构造出满足要求的表达式!

输入格式

The first line of the input contains a single integer nn (1≤n≤1051 \le n \le 10^5) — the amount of numbers on the paper.

The second line of the input contains nn integers a1,a2,…,ana_1, a_2, \ldots, a_n (0≤ai≤90 \le a_i \le 9), where aia_i is the ii-th element of aa.

The third line of the input contains the string ss (1≤∣s∣≤31 \le |s| \le 3) — symbols allowed in the expression. It is guaranteed that the string may only consist of symbols "-", "+" and "*". It is also guaranteed that all symbols in the string are distinct.

输入的第一行包含一个整数 nn(1≤n≤1051 \le n \le 10^5)—— 表示纸上的数字个数。

输入的第二行包含 nn 个整数 a1,a2,…,ana_1, a_2, \ldots, a_n(0≤ai≤90 \le a_i \le 9),其中 aia_i 是数组 aa 的第 ii 个元素。

输入的第三行包含一个字符串 ss(1≤∣s∣≤31 \le |s| \le 3)—— 表示表达式中允许使用的符号。保证该字符串仅由字符 "-"、"+" 和 "*" 组成,且字符串中所有字符互不相同。

输出格式

Print nn numbers separated by n−1n - 1 symbols — a mathematical expression with the greatest result. If there are multiple equally valid results — output any one of them.

输出 nn 个数字,它们之间用 n−1n - 1 个符号分隔——构成一个数学表达式,使其结果最大。若存在多个同样有效的结果,则输出其中任意一个即可。

输入输出样例

  • 输入#1

    3
    2 2 0
    +-*

    输出#1

    2*2-0
  • 输入#2

    4
    2 1 1 2
    +*

    输出#2

    2+1+1+2

说明/提示

The following answers also fit the first example: "2+2+0", "2+2-0", "2*2+0".

以下答案也符合第一个示例:“2+2+0”、“2+2-0”、“2*2+0”。

输入解题思路,AI测评打分。不知道怎么写?

首页