题目链接

  实际是一道线段树的模板题，就是区间更新变成两头更新而已了，多更新一次。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 2e5 + 7;
int N, M;
ll tree[maxN<<2], lazy[maxN<<2];
inline void pushup(int rt) { tree[rt] = min(tree[lsn], tree[rsn]); }
void buildTree(int rt, int l, int r)
{
    lazy[rt] = 0;
    if(l == r) { scanf("%lld", &tree[rt]); return; }
    int mid = HalF;
    buildTree(Lson);
    buildTree(Rson);
    pushup(rt);
}
inline void pushdown(int rt)
{
    if(lazy[rt])
    {
        tree[lsn] += lazy[rt];
        tree[rsn] += lazy[rt];
        lazy[lsn] += lazy[rt];
        lazy[rsn] += lazy[rt];
        lazy[rt] = 0;
    }
}
void update(int rt, int l, int r, int ql, int qr, int val)
{
    if(ql <= l && qr >= r)
    {
        tree[rt] += val;
        lazy[rt] += val;
        return;
    }
    pushdown(rt);
    int mid = HalF;
    if(qr <= mid) update(QL, val);
    else if(ql > mid) update(QR, val);
    else { update(QL, val); update(QR, val); }
    pushup(rt);
}
ll query(int rt, int l, int r, int ql, int qr)
{
    if(ql <= l && qr >= r) return tree[rt];
    pushdown(rt);
    int mid = HalF;
    if(qr <= mid) return query(QL);
    else if(ql > mid) return query(QR);
    else return min(query(QL), query(QR));
}
int main()
{
    scanf("%d", &N);
    buildTree(1, 1, N);
    scanf("%d", &M);
    int l, r, x;
    while(M--)
    {
        scanf("%d%d", &l, &r);
        l++;    r++;
        if(getchar() != '\n')
        {
            scanf("%d", &x);
            if(l <= r) update(1, 1, N, l, r, x);
            else
            {
                update(1, 1, N, l, N, x);
                update(1, 1, N, 1, r, x);
            }
        }
        else
        {
            if(l <= r) printf("%lld\n", query(1, 1, N, l, r));
            else printf("%lld\n", min(query(1, 1, N, l, N), query(1, 1, N, 1, r)));
        }
    }
    return 0;
}