CF935E.Fafa and Ancient Mathematics

提高+/省选-

通过率:0%

时间限制:2.00s

内存限制:256MB

AC君温馨提醒

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

题目描述

Ancient Egyptians are known to have understood difficult concepts in mathematics. The ancient Egyptian mathematician Ahmes liked to write a kind of arithmetic expressions on papyrus paper which he called as Ahmes arithmetic expression.

An Ahmes arithmetic expression can be defined as:

  • "d" is an Ahmes arithmetic expression, where d is a one-digit positive integer;
  • "(_E_1 op _E_2)" is an Ahmes arithmetic expression, where _E_1 and _E_2 are valid Ahmes arithmetic expressions (without spaces) and op is either plus ( + ) or minus ( - ).

For example 5, (1-1) and ((1+(2-3))-5) are valid Ahmes arithmetic expressions.

On his trip to Egypt, Fafa found a piece of papyrus paper having one of these Ahmes arithmetic expressions written on it. Being very ancient, the papyrus piece was very worn out. As a result, all the operators were erased, keeping only the numbers and the brackets. Since Fafa loves mathematics, he decided to challenge himself with the following task:

Given the number of plus and minus operators in the original expression, find out the maximum possible value for the expression on the papyrus paper after putting the plus and minus operators in the place of the original erased operators.

古埃及人以精通复杂的数学概念而闻名。古埃及数学家阿赫姆斯(Ahmes)喜欢在纸莎草纸上书写一种他称之为“阿赫姆斯算术表达式”的算术表达式。

一个阿赫姆斯算术表达式可定义如下:

  • “d” 是一个阿赫姆斯算术表达式,其中 d 是一位正整数;
  • “(_E_1 op _E_2)” 是一个阿赫姆斯算术表达式,其中 _E_1 和 _E_2 均为合法的阿赫姆斯算术表达式(不含空格),而 op 为加号( + )或减号( - )。

例如,5、(1-1) 和 ((1+(2-3))-5) 都是合法的阿赫姆斯算术表达式。

法法(Fafa)在埃及旅行时,发现了一张写有此类阿赫姆斯算术表达式的纸莎草纸片。由于年代久远,纸片严重磨损,导致所有运算符均被擦除,仅保留了数字和括号。由于法法热爱数学,他决定挑战自己完成以下任务:

给定原始表达式中加号与减号的个数,求将加号和减号填入被擦除的运算符位置后,该纸莎草纸上表达式所能达到的最大可能值。

输入格式

The first line contains a string E (1 ≤ |E| ≤ 104) — a valid Ahmes arithmetic expression. All operators are erased and replaced with '?'.

The second line contains two space-separated integers P and M (0 ≤ min(P, M) ≤ 100) — the number of plus and minus operators, respectively.

It is guaranteed that P + M =  the number of erased operators.

第一行包含一个字符串 EE(1≤∣E∣≤1041 \leq |E| \leq 10^4)—— 一个合法的 Ahmes 算术表达式,其中所有运算符均被删除并替换为 ?。

第二行包含两个用空格分隔的整数 PP 和 MM(0≤min⁡(P, M)≤1000 \leq \min(P,\,M) \leq 100)—— 分别表示加号和减号运算符的个数。

保证 P+M=P + M = 被删除的运算符总数。

输出格式

Print one line containing the answer to the problem.

输出一行,包含该问题的答案。

输入输出样例

  • 输入#1

    (1?1)
    1 0

    输出#1

    2
  • 输入#2

    (2?(1?2))
    1 1

    输出#2

    1
  • 输入#3

    ((1?(5?7))?((6?2)?7))
    3 2

    输出#3

    18
  • 输入#4

    ((1?(5?7))?((6?2)?7))
    2 3

    输出#4

    16

说明/提示

  • The first sample will be (1 + 1)  =  2.

  • The second sample will be (2 + (1 - 2))  =  1.

  • The third sample will be ((1 - (5 - 7)) + ((6 + 2) + 7))  =  18.

  • The fourth sample will be ((1 + (5 + 7)) - ((6 - 2) - 7))  =  16.

  • 第一个样例为 (1 + 1)  =  2(1 + 1)  =  2。

  • 第二个样例为 (2 + (1 − 2))  =  1(2 + (1 - 2))  =  1。

  • 第三个样例为 ((1 − (5 − 7)) + ((6 + 2) + 7))  =  18((1 - (5 - 7)) + ((6 + 2) + 7))  =  18。

  • 第四个样例为 ((1 + (5 + 7)) − ((6 − 2) − 7))  =  16((1 + (5 + 7)) - ((6 - 2) - 7))  =  16。

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

首页