zoj-K - Known Notation
来源:互联网 发布:c语言实训步骤怎么写 编辑:程序博客网 时间:2024/06/07 09:54
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:
- 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".
- 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
31*111*234***
Sample Output
102
题意:调整给出的表达式,使得它是AB*形式的,注意的是AB也可以看做是一个数
解法:对于*运算最少需要的数字个数是*个数+1,如果够则不需要加数字,否则就要加上数字;然后对于每次数字不够的时候,让*与最后的数字相换,就可以了
#include <vector>#include <map>#include <set>#include <algorithm>#include <iostream>#include <cstdio>#include <cmath>#include <cstdlib>#include <string>#include <cstring>#include <map>using namespace std;#define M 6int main(){int T;scanf("%d", &T);while(T --){string s;cin >> s;long long star=0,num=0;for(int i=0;i<s.length();i++){if(s[i]=='*')star++;else num++; } long long ans = 0;ans = star+1-num; ans = max(ans,(long long)0);star = 0; num = ans;int x = 0;for(int i=0;i<s.length();i++){if(s[i]=='*')star++;else num++;if(star == 1){if(num == 0){ans ++;num ++;star --;//x ++;}else if(num == 1){ans ++;num ++;star --;//x ++;}}if(star>=1 && num>1){star --;num --;}/*if(star+1>num)star--,num++,ans++; */} cout<<ans<<endl; } return 0; } /*100****324*****34343***23113343435*/
- zoj-K - Known Notation
- ZOJ - 3829 Known Notation
- ZOJ 3829 Known Notation
- zoj 3829 Known Notation
- zoj 3829 Known Notation
- zoj-Known Notation
- ZOJ - 3829 Known Notation
- ZOJ 3829 Known Notation
- ZOJ-3829-Known Notation
- ZOJ 3829 Known Notation
- Zoj 3829 Known Notation
- Known Notation ZOJ
- ZOJ 3822 Known Notation(2014牡丹江Regional K题)
- zoj 3829 (2014牡丹江区域赛K) Known Notation
- zoj 3829 Known Notation(贪心)
- zoj 3829 Known Notation 贪心
- ZOJ 3829 Known Notation 乱搞
- ZOJ 3829 Known Notation 贪心
- 使用单例模式getInstance() 有什么好处
- hdu4217(求区间k小)
- window下的java程序连接linux系统的mysql数据库
- 麦肯锡解决问题七步法
- Effective c++学习笔记四
- zoj-K - Known Notation
- HDU 1250 Hat's Fibonacci(高精度)
- C#学习日记05---数据类型 之 布尔类型
- 【C++】c++日期类Date
- JSP/Servlet 工作原理
- 字典学习方法—K-SVD
- codeforces 453B B. Little Pony and Harmony Chest(dp+数论)
- JPA主键生成策略
- equals ()与 hashcode() 与 == 解析