Codeforces Round #420 (Div. 2) 821C
来源:互联网 发布:英文缩写查询软件 编辑:程序博客网 时间:2024/06/05 07:36
Okabe and Super Hacker Daru are stacking and removing boxes. There are n boxes numbered from 1 to n. Initially there are no boxes on the stack.
Okabe, being a control freak, gives Daru 2n commands: n of which are to add a box to the top of the stack, and n of which are to remove a box from the top of the stack and throw it in the trash. Okabe wants Daru to throw away the boxes in the order from 1 to n. Of course, this means that it might be impossible for Daru to perform some of Okabe's remove commands, because the required box is not on the top of the stack.
That's why Daru can decide to wait until Okabe looks away and then reorder the boxes in the stack in any way he wants. He can do it at any point of time between Okabe's commands, but he can't add or remove boxes while he does it.
Tell Daru the minimum number of times he needs to reorder the boxes so that he can successfully complete all of Okabe's commands. It is guaranteed that every box is added before it is required to be removed.
The first line of input contains the integer n (1 ≤ n ≤ 3·105) — the number of boxes.
Each of the next 2n lines of input starts with a string "add" or "remove". If the line starts with the "add", an integer x (1 ≤ x ≤ n) follows, indicating that Daru should add the box with number x to the top of the stack.
It is guaranteed that exactly n lines contain "add" operations, all the boxes added are distinct, and n lines contain "remove" operations. It is also guaranteed that a box is always added before it is required to be removed.
Print the minimum number of times Daru needs to reorder the boxes to successfully complete all of Okabe's commands.
3add 1removeadd 2add 3removeremove
1
7add 3add 2add 1removeadd 4removeremoveremoveadd 6add 7add 5removeremoveremove
2
In the first sample, Daru should reorder the boxes after adding box 3 to the stack.
In the second sample, Daru should reorder the boxes after adding box 4 and box 7 to the stack.
用vector模拟这个过程,遇到不满足时,将vector清空
#include<iostream>#include<algorithm>#include<cmath>#include<cstdio>#include<cstdlib>#include<queue>#include<map>#include<set>#include<stack>#include<bitset>#include<numeric>#include<vector>#include<string>#include<iterator>#include<cstring>#include<functional>#define INF 0x3f3f3f3f#define ms(a,b) memset(a,b,sizeof(a))using namespace std;const int maxn = 1010;const int mod = 1e9 + 7;const double pi = 3.14159265358979;typedef pair<int, int> P;typedef long long ll;typedef unsigned long long ull;int main(){int n;while (~scanf("%d", &n)){int cnt = 1, num = 0, ans = 0;vector<int> vec;for (int i = 0; i < 2 * n; i++){char s[10] = { 0 };scanf("%s", s);if (s[0] == 'a'){int p;scanf("%d", &p);vec.push_back(p);}else{if (vec.empty());else if (vec.back() == cnt){vec.pop_back();}else{ans++;vec.clear();}cnt++;}}printf("%d\n", ans);}}
- Codeforces Round #420 (Div. 2) 821C
- Codeforces Round #420 (Div. 2) C
- 【codeforces】Codeforces Round #370 (Div. 2) C
- Codeforces Round #420 (Div. 2) 821
- Codeforces Round #420 (Div. 2)
- Codeforces Round #420 (Div. 2)
- Codeforces Round #420 (Div. 2)
- Codeforces Round #420 (Div.2)
- Codeforces Round #420 (Div. 2)
- Codeforces Round #420 (Div. 2) C. Okabe and Boxes
- CF-Codeforces Round #420 (Div. 2)-C-Okabe and Boxes
- Codeforces Round #420 (Div. 2) A B C
- Codeforces Round #420 (Div. 2) C. Okabe and Boxes 思维
- Codeforces Round #105 (Div. 2) C
- Codeforces Round 134 div 2 C题
- Codeforces Round #137 (Div. 2), problem: (C)
- Codeforces Round #153 (Div. 2) C题
- Codeforces Round #158 (Div. 2) C题
- oracle '',null
- [DFS] leetcode 100. Same Tree
- Context都没弄明白,还怎么做Android开发?
- Android之FlexboxLayout弹性布局的介绍
- java系统高并发解决方案
- Codeforces Round #420 (Div. 2) 821C
- 快速幂取模算法
- 小米手机android studio常见错误
- Jquery瀑布流布局
- mysql count多个表
- html常用知识
- Python刷csdn访问量
- 2017.6.26 旅行 思考记录
- [RK3288][Android6.0] RTC模块RX8010SJ驱动添加及改动