解题报告 之 ZOJ 3829 Known Notation
来源:互联网 发布:装饰公司网络销售 编辑:程序博客网 时间:2024/05/21 13:23
解题报告 之 ZOJ 3829 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:
- 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
#include<iostream>#include<cstdio>#include<algorithm>#include<stack>#include<string>using namespace std;int main(){int T;scanf( "%d", &T );string str;while(T--){cin >> str;int num=0, sym=0;int ans=0;int l = str.length();for(int i = 0; i < l; i++){if(str[i] == '*')sym++;}int add = max(0,sym + 1 - (l - sym));ans += add;int Num = 0, Sym = 0;for(int i = 0; i < l; i++){if(str[i] != '*')Num++;else{Sym++;if(Num < Sym + 1){if(add > 0){add--;Num++;}else{Num++;Sym--;ans++;}}}}printf( "%d\n", ans );}return 0;}
就是这样,区域赛靠叔叔拿铜。~~
- 解题报告 之 ZOJ 3829 Known Notation
- ZOJ - 3829 Known Notation
- ZOJ 3829 Known Notation
- zoj 3829 Known Notation
- zoj 3829 Known Notation
- ZOJ - 3829 Known Notation
- ZOJ 3829 Known Notation
- ZOJ-3829-Known Notation
- ZOJ 3829 Known Notation
- Zoj 3829 Known Notation
- zoj 3829 Known Notation(贪心)
- zoj 3829 Known Notation 贪心
- ZOJ 3829 Known Notation 乱搞
- ZOJ 3829 Known Notation 贪心
- zoj 3829 Known Notation (贪心)
- [贪心+模拟] zoj 3829 Known Notation
- ZOJ 3829 Known Notation --贪心+找规律
- ZOJ 3829 Known Notation(贪心)
- Swift学习- 下标脚本(十二)
- 二分查找
- HashMap与HashTable面试宝典
- [c++]无锁队列
- POJ 3984:迷宫问题 bfs+递归输出路径
- 解题报告 之 ZOJ 3829 Known Notation
- C语言实现的猜数字小游戏(主要是对于自定义函数的运用)
- ip转换为纯数字(如何用数字表示ip?)
- LINUX下GDB调试
- Java编程思想作者引用的10大Java书籍选登
- Codeforces Round #321 (Div. 2)C. Kefa and Park
- C#windfrom控件之datagridview(一)
- js-回调函数
- POJ 3916:Duplicate Removal 将相近的重复元素删除