ZOJ 3829 Known Notation（模拟+YY）——The 2014 ACM-ICPC Asia Mudanjiang Regional Cont

传送门

Do you know reverse Polish notation (RPN)? It is a known notation in the area of mathematics and computer science. It is also known as postfix notation since every operator in an expression follows all of its operands. Bob is a student in Marjar University. He is learning RPN recent days.

To clarify the syntax of RPN for those who haven’t learnt it before, we will offer some examples here. For instance, to add 3 and 4, one would write “3 4 +” rather than “3 + 4”. If there are multiple operations, the operator is given immediately after its second operand. The arithmetic expression written “3 - 4 + 5” in conventional notation would be written “3 4 - 5 +” in RPN: 4 is first subtracted from 3, and then 5 added to it. Another infix expression “5 + ((1 + 2) × 4) - 3” can be written down like this in RPN: “5 1 2 + 4 × + 3 -“. An advantage of RPN is that it obviates the need for parentheses that are required by infix.

In this problem, we will use the asterisk “*” as the only operator and digits from “1” to “9” (without “0”) as components of operands.

You are given an expression in reverse Polish notation. Unfortunately, all space characters are missing. That means the expression are concatenated into several long numeric sequence which are separated by asterisks. So you cannot distinguish the numbers from the given string.

You task is to check whether the given string can represent a valid RPN expression. If the given string cannot represent any valid RPN, please find out the minimal number of operations to make it valid. There are two types of operation to adjust the given string:

1. Insert. You can insert a non-zero digit or an asterisk anywhere. For example, if you insert a “1” at the beginning of “2*3*4”, the string becomes “12*3*4”.
2. Swap. You can swap any two characters in the string. For example, if you swap the last two characters of “12*3*4”, the string becomes “12*34*”.

The strings “2*3*4” and “12*3*4” cannot represent any valid RPN, but the string “12*34*” can represent a valid RPN which is “1 2 * 34 *”.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

There is a non-empty string consists of asterisks and non-zero digits. The length of the string will not exceed 1000.

Output

For each test case, output the minimal number of operations to make the given string able to represent a valid RPN.

Sample Input

3
1*1
11*234**
*

题目大意：

给定一个只含 1-9 的数字和 ‘*’ 的字符串，让你只用如下两个操作使得这个字符串成为逆波兰式：
1) 增加：在任意位置增加一个数字
2) 交换：可以交换字符串中任意两个字符

解题思路：

经过YY发现，其实当数字的个数 大于或者等于’*’的个数的时候我们就只需要用第二个操作就OK了，然后我们还发现下面这样的式子是最优的：
11*1*1*1*
所以首先我们判断一下数字的个数和 * 的个数
1): 如果数字的个数 +1 大于等于 * 的个数，那么我们只需要将其进行第二个操作，然后从前往后扫描，如果遇到一个 * , 我们就比较数字的个数 和 * 的个数，如果数字的个数 +1 大于等于 * 的个数不错任何判断，否则就进行交换，交换的是当前的 * 和从后往前扫描的第一个数字，最后统计结果
2): 即数字的个数 +1 小于 * 的个数，我们首先进行插入一个数字，显然插入的数字一定是在前面的，然后字符串进行了改变，其实我们可以将这个改变的字符串进行缩短，也就是 如果我们需要插入 a 个数字，那么我们就将原字符串从前往后删除 a 个 *，剩下的跟 1) 是一样的，也是扫描记录结果。
例如：
原字符串 s = “1**1” 需要增加在前面 1 个 数字
改变后的字符串，s’ = “11**1”
缩短后的字符串 s” = “1*1”
s’ 与 s” 结果是相同的，而且 s” 的长度较短，比较省事儿一些。

代码：

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int MAXN = 1e3+5;
char str[MAXN];
int main()
{
    int T;
    scanf("%d", &T);
    while(T--){
        scanf("%s", str);
        int len = strlen(str);
        int sumd = 0, sumc = 0, ans = 0;
        for(int i=0; i<len; i++){
            if(str[i] == '*') sumc++;
            else sumd++;
        }
        if(sumd < sumc+1) ans = sumc + 1 - sumd;
        string s = "";
        int tmp = 0;
        for(int i=0; i<len; i++){
            if(tmp == ans) s += str[i];
            else{
                if(str[i] != '*') s+= str[i];
                else tmp++;
            }
        }
        len = s.length();
        sumd = 0, sumc = 0;
        for(int i=0; i<len; i++){
            if(s[i] == '*'){
                sumc++;
                if(sumd-sumc >= 1) continue;
                for(int j=len-1; j>i; j++){
                    if(s[j] != '*'){
                        sumc--;
                        sumd++;
                        swap(s[i],s[j]);
                        ans++;
                        break;
                    }
                }
            }
            else sumd++;
        }
        cout<<ans<<endl;
    }
    return 0;
}