zoukankan      html  css  js  c++  java
  • CodeForces

    #include "iostream"  
    #include "cstdio"  
    #include "cstring"  
    #include "algorithm"  
    #include "queue"  
    #include "stack"  
    #include "cmath"  
    #include "utility"  
    #include "map"  
    #include "set"  
    #include "vector"  
    #include "list"  
    #include "string"  
    #include "cstdlib"  
    using namespace std;  
    typedef long long ll;  
    #define X first  
    #define Y second  
    const int MOD = 1e9 + 7;  
    const int INF = 0x3f3f3f3f;  
    const int MAXN = 2e5 + 5;  
    int n, m, num;  
    int main(int argc, char const *argv[])  
    {  
        scanf("%d%d", &n, &m);  
        std::vector<int> a(n), b(n + 2, -1), c(n + 2, -1);  
        for(int i = 0; i < n; ++i)  
            cin >> a[i];  
        for(int i = 0; i < m; ++i) {  
            int x, y;  
            scanf("%d%d", &x, &y);  
            b[y - 1] = x;  
            c[y - 1] = i + 1;  
            num = max(num, y);  
        }  
        std::vector<int> tmp = a, ans = a;  
        sort(tmp.begin(), tmp.begin() + num);  
        int x = 0, y = num - 1;  
        for(int i = num - 1; i >= 0; --i) {  
            if(c[i] < c[i + 1]) {  
                c[i] = c[i + 1];  
                b[i] = b[i + 1];  
            }  
            if(b[i] == 2) ans[i] = tmp[x++];  
            else ans[i] = tmp[y--];  
        }  
        for(int i = 0; i < n; ++i)  
            printf("%d ", ans[i]);  
        return 0;  
    }

    题意:给定n个数和m次操作。 
    1xi 表示将前xi个数升序排列. 
    2xi 表示将前xi个数降序排列. 
    让你输出变化后的序列.

    Each month Blake gets the report containing main economic indicators of the company "Blake Technologies". There are n commodities produced by the company. For each of them there is exactly one integer in the final report, that denotes corresponding revenue. Before the report gets to Blake, it passes through the hands of m managers. Each of them may reorder the elements in some order. Namely, the i-th manager either sorts first ri numbers in non-descending or non-ascending order and then passes the report to the manageri + 1, or directly to Blake (if this manager has number i = m).

    Employees of the "Blake Technologies" are preparing the report right now. You know the initial sequence ai of length n and the description of each manager, that is value ri and his favourite order. You are asked to speed up the process and determine how the final report will look like.

    Input

    The first line of the input contains two integers n and m (1 ≤ n, m ≤ 200 000) — the number of commodities in the report and the number of managers, respectively.

    The second line contains n integers ai (|ai| ≤ 109) — the initial report before it gets to the first manager.

    Then follow m lines with the descriptions of the operations managers are going to perform. The i-th of these lines contains two integers tiand ri (1 ≤ ri ≤ n), meaning that the i-th manager sorts the first ri numbers either in the non-descending (if ti = 1) or non-ascending (if ti = 2) order.

    Output

    Print n integers — the final report, which will be passed to Blake by manager number m.

    Examples
    input
    3 1
    1 2 3
    2 2
    output
    2 1 3 
    input
    4 2
    1 2 4 3
    2 3
    1 2
    output
    2 4 1 3 
  • 相关阅读:
    项目开发问题笔记
    HDU 1800——Flying to the Mars——————【字符串哈希】
    FZU 2122 ——又见LKity——————【KMP字符串匹配】
    FZU 2122——又见LKity——————【字符串匹配、暴力】
    POJ 3468——A Simple Problem with Integers——————【线段树区间更新, 区间查询】
    HRBUST 1909——理工门外的树——————【离线处理,差分前缀和】
    HRBUST 1161——Leyni——————【线段树单点更新,区间查询】
    用Gvim建立IDE编程环境 (Windows篇)
    FZU 2207 ——以撒的结合——————【LCA + 记录祖先】
    HDU 5635 ——LCP Array ——————【想法题】
  • 原文地址:https://www.cnblogs.com/Aragaki/p/7073423.html
Copyright © 2011-2022 走看看