Codeforces 821C-Okabe and Boxes
来源:互联网 发布:js获取文本框的内容 编辑:程序博客网 时间:2024/04/20 12:49
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 <cstdio>#include <string>#include <cstring>#include <algorithm>#include <queue>#include <vector>#include <set>#include <stack>#include <map>#include <climits>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;int n, x;char ch[30];int main(){while (~scanf("%d", &n)){vector<int>g;int ans = 0, cnt=1;for (int i = 1; i <= 2 * n; i++){scanf("%s", ch);if (!strcmp(ch, "add")){scanf("%d", &x);g.push_back(x);}else{if (g.empty());else if (g.back() == cnt) g.pop_back();else{ans++;g.clear();}cnt++;}}printf("%d\n", ans);}return 0;}
- Codeforces 821 C. Okabe and Boxes
- Codeforces 821C-Okabe and Boxes
- Codeforces 821C Okabe and Boxes 题解
- 【Codeforces 821C. Okabe and Boxes】
- Codeforces 821C Okabe and Boxes 思维模拟
- Okabe and Boxes CodeForces
- codeforces 420 div2 C Okabe and Boxes
- Codeforces#420 C. Okabe and Boxes
- Codeforces Round #420 C. Okabe and Boxes
- codeforces 420-C. Okabe and Boxes
- C. Okabe and Boxes
- CodeFroces 821C Okabe and Boxes(栈?)
- Codefores 821C Okabe and Boxes
- Codeforces#420 Okabe and Boxes
- 栈 Okabe and Boxes:CodeForces
- Codeforces Round #420 (Div. 2) C. Okabe and Boxes
- CF-Codeforces Round #420 (Div. 2)-C-Okabe and Boxes
- Codeforces Round #420 (Div. 2) C. Okabe and Boxes 思维
- react listview篇-1
- eGTouchD异常导致CPU占用率升高
- iOS Xcode中的常用快捷键
- 人狼羊菜过河
- 10、自定义mybatis的plugin拦截器
- Codeforces 821C-Okabe and Boxes
- 服务器请求与响应[思维导图]
- 程序渣自学一些心得_读书和学习
- 二叉树的前中后序遍历
- 自定义快速滚动条FastScrollBar
- JVM(二)— JVM内存模型
- 关于flask db.create_all()无法创建表
- php使用curl调用小程序登录接口
- Activiti工作流