zoukankan      html  css  js  c++  java
  • Codeforces Round #420 (Div. 2) 821C

    C. Okabe and Boxes
    time limit per test
    3 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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.

    Input

    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.

    Output

    Print the minimum number of times Daru needs to reorder the boxes to successfully complete all of Okabe's commands.

    Examples
    input
    3
    add 1
    remove
    add 2
    add 3
    remove
    remove
    
    output
    1
    
    input
    7
    add 3
    add 2
    add 1
    remove
    add 4
    remove
    remove
    remove
    add 6
    add 7
    add 5
    remove
    remove
    remove
    
    output
    2
    
    Note

    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
    ", ans);
    	}
    }

     
    Fighting~
  • 相关阅读:
    Android 图片文字单位 px、dp、sp区别
    替换Fragment 报错 The specified child already has a parent. You must call removeView() on the child's parent first.
    Android 程序怎么打log
    Android 启动项 Activity
    Actiivity 生命周期
    Oracle 监听/数据库 启动/关闭
    【HDU-2049】不容易系列之(4)——考新郎
    Linux内存子系统——Locking Pages(内存锁定)
    command三国杀开发日记20200915
    command三国杀开发日记20200914
  • 原文地址:https://www.cnblogs.com/Archger/p/12774766.html
Copyright © 2011-2022 走看看