#420 C. Okabe and Boxes(Div.2)
来源:互联网 发布:数据库系统第五版答案 编辑:程序博客网 时间:2024/05/17 23:51
题目链接: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 <bits/stdc++.h>#define N 300009using namespace std;string s;int a[N];int main(){ int n, num; scanf("%d", &n); int ans, len, cur; len = ans = 0; cur = 1; for(int i = 1; i <= 2*n; i++) { cin >> s; if(s == "add") { scanf("%d", &num); a[len++] = num; continue; } if(len == 0) { cur++; continue; } if(a[len-1] == cur) { cur++; len--; continue; } ans++; cur++; len = 0; } printf("%d\n", ans); return 0;}
- #420 C. Okabe and Boxes(Div.2)
- Codeforces Round #420 (Div. 2) C. Okabe and Boxes
- #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 Round #420 (Div. 2) C. Okabe and Boxes 栈+last标记+贪心
- C. Okabe and Boxes
- coderforces round#420-C Okabe and Boxes
- 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
- Codeforces#420 Okabe and Boxes
- Codeforces 821 C. Okabe and Boxes
- Codeforces 821C-Okabe and Boxes
- Codeforces 821C Okabe and Boxes 题解
- CodeFroces 821C Okabe and Boxes(栈?)
- Codefores 821C Okabe and Boxes
- TelephonyManager和ITelehony.aidl调用关系的实现
- Detecting Violence in Video using Subclasses
- 算法分析课每周练习 Word Break II
- TF官方介绍示例py3改
- CSS伪元素解读
- #420 C. Okabe and Boxes(Div.2)
- RxAndroid教程
- Unity可扩展编辑器
- IOS开发-CALayer和UIView详细汇总
- z-index的负值使用
- Masonry介绍与使用实践:快速上手Autolayout
- 横向ListView之HorizontalListView
- Spring MVC 处理htttp请求流程
- Hyper容器云及云上运维