CodeForces 52C Circular RMQ （线段树）

线段树区间更新维护最小值。。。记得下放标记。。。

如果线段树上的一个完整区间被修改，那么最小值和最大值增加相应的值后不变，

会改变是因为一部分改变而另外一部分没有改变所以维护一下就好。

询问的时候也要记得下放标记。。。

数据结构快忘了，贴个板。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5+;

struct Seg
{
    ll lazy;
    ll Min;
}tr[maxn<<];

int a[maxn];
int n;

#define lid (id<<1)
#define rid (id<<1|1)

void build(int l = ,int r = n-,int id = )
{
    if(l == r) { tr[id].Min = a[l]; return; }//tr[rt].lazy }
    int mid = (l+r)>>, lc = lid, rc = rid;
    build(l,mid,lc);
    build(mid+,r,rc);
    tr[id].Min = min(tr[lc].Min,tr[rc].Min);
}

int ql,qr;
ll val;

#define Modify(id,v) tr[id].lazy += v; tr[id].Min += v;
void updata(int l = ,int r = n-,int id = )
{
    if(ql<=l&&r<=qr) { Modify(id,val)  return; }
    int mid = (l+r)>>, lc = lid, rc = rid;
    if(tr[id].lazy){
        ll &t = tr[id].lazy;
        Modify(lc,t)
        Modify(rc,t)
        t = ;
    }
    if(ql<=mid){
        updata(l,mid,lc);
    }
    if(qr>mid) {
        updata(mid+,r,rc);
    }
    tr[id].Min = min(tr[lc].Min,tr[rc].Min);
}

const ll INF = 0x3f3f3f3f3f3f3f3f;

ll query(int l = ,int r = n-,int id = )
{
    if(ql<=l&&r<=qr){
        return tr[id].Min;
    }
    int mid = (l+r)>>,lc = lid, rc = rid;
    if(tr[id].lazy){
        ll &t = tr[id].lazy;
        Modify(lc,t);
        Modify(rc,t);
        t = ;
    }
    ll ret = INF;
    if(ql<=mid){
        ret = min(ret,query(l,mid,lc));
    }
    if(qr>mid){
        ret = min(ret,query(mid+,r,rc));
    }
    return ret;
}

bool sscan_l(int &x,char *&s)
{
    while(!isdigit(*s) && *s != '-'){
        if(!*s) return false;
        s++;
    }
    bool fg;
    if(*s == '-') fg = true,x = ;
    else x = *s-'',fg = false;

    while(s++,isdigit(*s)) x = x*+*s-'';
    if(fg) x = -x;
    return true;
}

char Line[];
int main()
{
    //freopen("in.txt","r",stdin);
    scanf("%d",&n);
    for(int i = ; i < n; i++) scanf("%d",a+i);
    build();
    int m; scanf("%d\n",&m);
    while(m--){
        gets(Line);
        char *p = Line;
        int num[], i;
        for(i = ; i < ; i++ ){
            if(!sscan_l(num[i],p)) break;
        }
        if(i == ){
            int l = num[],r = num[];
            if(l<=r) {
                ql = l; qr = r;
                printf("%I64d\n",query());
            }else {
                ql = ; qr = r;
                ll ans = query();
                ql = l; qr = n-;
                ans = min(ans,query());
                printf("%I64d\n",ans);
            }
        }else {
            int l = num[], r = num[]; val = num[];
            if(l<=r){
                ql = l; qr = r;
                updata();
            }else {
                ql = ; qr = r;
                updata();
                ql = l; qr = n-;
                updata();
            }
        }
    }
    return ;
}