ZOJ 3829 Known Notation （字符串处理 牡丹江现场赛K题）

前言：这回现场赛做下来。还是有一点小失落的。毕竟是打铁。但是从中我们也找到了自己的很多问题。比如没有及时补题的习惯。现在开这么一个博客，准备开始补题加上刷题，为了明年省赛和明年亚洲区域赛做准备。努力加油！！！！

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5383

Problem K.Known Notation

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 intput

3
1*1
11*234**
*

sample output

1
0
2

解题思路：

	现场赛的时候考虑了各种分类讨论。结果卡死在输入为1的情况下输入应该是0的=。=悲剧。。这题要考虑num 和star的数量，如果不管部分区域星号比数字多的情况 我们也需要比较星号数量和数字数量的大小，如果星号+1比数字多的话，先在前面加入star-num+1个数字，然后如果数字不够的话，把前面的星星和后面的数字交换。就不用各种讨论了。

AC代码如下：

#include <iostream>
#include <cstdio>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#define esp 1e-6
#define inf 0x0f0f0f0f
#define LL long long  
using namespace std;

int main()
{
	int p,i,j,k,l,m,n,num,star,len,ans,tnum,tstar;
	int T;
	char a[1005];
	scanf("%d%*c",&T);
	while(T--)
	{
		star=num=tstar=tnum=ans=0;
		memset(a,'\0',sizeof(a));
		gets(a);
		len=strlen(a);
		for(i=0;i<len;i++)
		{
			if(a[i]=='*')	star++;
			else num++;
		}
		if(star-num+1>=0)
		{
			ans=star-num+1;
		}
		tnum=ans;
		for(i=0;i<len;i++)
		{
			p=len-1;
			while(i<p&&a[p]=='*')	p--;
			if(a[i]=='*')
			{
				tnum--;
				if(tnum<1)
				{
					swap(a[i],a[p]);
					ans++;
					p--;
					tnum+=2;
				}
			}
			else
				tnum++;	
		}
		printf("%d\n",ans);
		
	}
	
}