Codeforces#420 Okabe and Boxes
来源:互联网 发布:淘宝网婴儿鞋 编辑:程序博客网 时间:2024/05/01 22:32
题目网址:http://codeforces.com/contest/821/problem/C
题目:
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.
代码:
#include <cstdio>#include <stack>#include <cstring>#include <stack>using namespace std;stack<int>s;int main(){ int n; int cur=1; int res=0; scanf("%d",&n); for (int i=0; i<2*n; i++) { char str[10]; int num; scanf("%s",str); if(strcmp(str, "add")==0){ scanf("%d",&num); s.push(num); }else{ if(!s.empty() && s.top()==cur){ s.pop(); } else{ if(!s.empty()) res++; while (!s.empty()) {s.pop();} } cur++; } } printf("%d\n",res); return 0;}
- Codeforces#420 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
- 栈 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 思维
- Codeforces 821 C. Okabe and Boxes
- Codeforces 821C-Okabe and Boxes
- Codeforces 821C Okabe and Boxes 题解
- 【Codeforces 821C. Okabe and Boxes】
- coderforces round#420-C Okabe and Boxes
- CF Okabe and Boxes
- C. Okabe and Boxes
- Codeforces821C Okabe and Boxes
- MySQL查询今天、昨天、本周、本月、本季、本年的数据
- 剑指offer——变态跳台阶
- 跨域资源共享(CORS)问题解决
- 修改MySQL的默认密码的四种小方法
- c#日志
- Codeforces#420 Okabe and Boxes
- js中SetInterval与setTimeout用法
- Hadoop 集群命令
- CRT Library Features
- 【待完成】CentOS6.5安装mysql-cluster-community-7.5.6-1.el6.x86_64.rpm-bundle.tar
- 程序猿和星座之间不可不谈的事
- Python 基础元素
- 关于JQuery的使用(简单验证,多选框批量删除&导出)
- 多线程