After receiving yet another integer array $a_{1}$,$a_{2}$,…,$a_{n}$ at her birthday party, Index decides to perform some operations on it. Formally, there are m operations that she is going to perform in order. Each of them belongs to one of the two types:
For example, if the initial array a=[7,1,3,4,3], after performing the operation + 2 4, the array a=[7,1,4,5,4]. Then, after performing the operation - 1 10, the array a=[6,0,3,4,3]. Index is curious about the maximum value in the array a. Please help her find it after each of the m operations.
Each test consists of multiple test cases. The first line contains a single integer t (1≤t≤2⋅$10^{4}$) — the number of test cases. The description of the test cases follows. The first line of each test case contains two integers n and m (1≤n≤$10^{5}$, 1≤m≤$10^{5}$) — the length of the array and the number of operations. The second line of each test case contains n integers $a_{1}$,$a_{2}$,…,$a_{n}$ (1≤$a_{i}$≤$10^{9}$) — the initial array a. Then m lines follow, each line corresponds to the operation, in the following format: c l r (c∈{+,-}, l and r are integers, 1≤l≤r≤$10^{9}$) — the description of the operation. Note that the elements $a_{i}$ may not satisfy 1≤$a_{i}$≤$10^{9}$ after some operations, as it is shown in the example. It is guaranteed that the sum of n over all test cases does not exceed $10^{5}$, and the sum of m over all test cases does not exceed $10^{5}$.
For each test case, output one single line containing m integers, with the i-th of them describing the maximum value of the array after the i-th operation.
1 5 5 1 2 3 2 1 + 1 3 - 2 3 + 1 2 + 2 4 - 6 8
4 4 4 5 5
In the first test case, the process of the operations is listed below:
編號 | 身分 | 題目 | 主題 | 人氣 | 發表日期 |
沒有發現任何「解題報告」 |