A9905 | Vanya and Brackets
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Vanya is doing his maths homework. He has an expression of form , where $x_{1},x_{2},...,x_{n}$ are digits from $1$ to $9$ , and sign  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.
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$ ).
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$ ).
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted