Circular RMQ CodeForces - 52C(线段树)

题目链接:点我

---

You are given circular array a0, a1, ..., an - 1. There are two types of operations with it:

    inc(lf, rg, v) — this operation increases each element on the segment [lf, rg] (inclusively) by v;
    rmq(lf, rg) — this operation returns minimal value on the segment [lf, rg] (inclusively).

Assume segments to be circular, so if n = 5 and lf = 3, rg = 1, it means the index sequence: 3, 4, 0, 1.

Write program to process given sequence of operations.

Input

The first line contains integer n (1 ≤ n ≤ 200000). The next line contains initial state of the array: a0, a1, ..., an - 1 ( - 106 ≤ ai ≤ 106), ai are integer. The third line contains integer m (0 ≤ m ≤ 200000), m — the number of operartons. Next m lines contain one operation each. If line contains two integer lf, rg (0 ≤ lf, rg ≤ n - 1) it means rmq operation, it contains three integers lf, rg, v (0 ≤ lf, rg ≤ n - 1; - 106 ≤ v ≤ 106) — inc operation.

Output

For each rmq operation write result for it. Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d).

Example
Input

4
1 2 3 4
4
3 0
3 0 -1
0 1
2 1

Output

1
0
0

---

题意:

给你一个循环序列,有两种操作:
1. 区间(lg, rg) 的所有元素加上V;
2. 查询区间(lg, rg) 的最小值.

思路:

线段树的区间查询与更新,我们用线段树维护区间的最小值,并且设置一个懒惰标记来延迟更新.

代码: