测评会员优惠活动进行中 · 开通 VIP,有效期内测评不限次 VIP 优惠中 · 测评不限次 立即查看

A9905. Vanya and Brackets

编程题 普及/提高-

题目描述

Vanya is doing his maths homework. He has an expression of form ![](/uploads/luogu/CF552E/b8c6979b49468fd46854350f61bc168b56400c5a_81141cf25967.png), where $x_{1},x_{2},...,x_{n}$ are digits from $1$ to $9$ , and sign ![](/uploads/acgo/image/0aebd7f0d86ecac2_5d267c06d22d.jpeg) represents either a plus '+' or the multiplication sign '\*'. Vanya needs to add one pair of brackets in this expression so that to maximize the value of the resulting expression.

输入格式

The first line contains expression $s$ ( $1<=|s|<=5001$ , $|s|$ is odd), its odd positions only contain digits from $1$ to $9$ , and even positions only contain signs $+$ and $*$ .

The number of signs $*$ doesn't exceed 15.

输出格式

In the first line print the maximum possible value of an expression.

输入输出样例

输入 #1
3+5*7+8*4
输出 #1
303
输入 #2
2+3*5
输出 #2
25
输入 #3
3*4*5
输出 #3
60

说明/提示

Note to the first sample test. $3+5*(7+8)*4=303$ .

Note to the second sample test. $(2+3)*5=25$ .

Note to the third sample test. $(3*4)*5=60$ (also many other variants are valid, for instance, $(3)*4*5=60$ ).
上一题 去做题 下一题