CF52C Circular RMQ

You are given circular array $ a_{0},a_{1},...,a_{n-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.

The first line contains integer $ n $ ( $ 1

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).