Codeforces 631C

Codeforces 631C - Report

Report

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 r_i numbers in non-descending or non-ascending order and then passes the report to the manager i + 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 a_i of length n and the description of each manager, that is value r_i 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 a_i (|a_i| ≤ 10⁹) — 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 ti and r_i (t_i ∈ {1, 2}, 1 ≤ r_i ≤ n), meaning that the i-th manager sorts the first r_i numbers either in the non-descending (if t_i = 1) or non-ascending (if t_i = 2) order.

Output:

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

範例:

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 

Note:

In the first sample, the initial report looked like: 1 2 3. After the first manager the first two numbers were transposed: 2 1 3. The report got to Blake in this form.

In the second sample the original report was like this: 1 2 4 3. After the first manager the report changed to: 4 2 1 3. After the second manager the report changed to: 2 4 1 3. This report was handed over to Blake.

題意:

它會給你一組數列有n個數，而你要依據它的t做判斷是否為升序或降序，再從頭到r做排列，共有m組t和r。

思路:

找出最大的r做排序，從剩下沒被排序的數先儲存起來，再從剩下的t和r組，找尋最大的r，然後看上一個最大的r和t為升序或者是降序決定儲存方向t[i-1]和長度r[i-1]-r[i]。

*建議直接把程式碼複製執行被註解掉的cout會比較清楚。

ex:
4 2
1 2 4 3
2 3
1 2

4 2 1 |3 :數列
-> <- <- :方向t[i-1],和長度r[i-1] - r[i]
2 3 1 :儲存順序

程式碼: