Codeforces 52C Circular RMQ

不想说什么了，这两天脑袋被门夹了……

#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>

#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <bitset>
#include <memory>
#include <complex>
#include <numeric>

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <ctype.h>
#include <locale.h>

using namespace std;

#pragma pack(4)

const double  eps = 1e-8;
const double   pi = acos(-1.0);
const long long     inf = 0x7f7f7f7f;

#define loop(a,n)                            \
    for(long long i=0;n>i;i++)                     \
        cout<<a[i]<<(i!=n-1?' ':'\n')
#define loop2(a,n,m)                         \
    for(long long i=0;n>i;i++)                     \
        for(long long j=0;m>j;j++)                 \
            cout<<a[i][j]<<(j!=m-1?' ':'\n')

#define   at(a,i) ((a)&(1<<(i)))
#define   nt(a,i) ((a)^(1<<(i)))
#define set1(a,i) ((a)|(1<<(i)))
#define set0(a,i) ((a)&(~(1<<(i))))

#define cmp(a,b) (fabs((a)-(b))<eps?0:(((a)-(b))>eps?+1:-1))

#define lmax(a,b) ((a)>(b)?(a):(b))
#define lmin(a,b) ((a)<(b)?(a):(b))
#define fmax(a,b) (cmp(a,b)>0?(a):(b))
#define fmin(a,b) (cmp(a,b)<0?(a):(b))

const long long MAXV = 200002;

class segmentTree
{
private:
    long long left,right,ans[MAXV<<2],lazy[MAXV<<2];

    #define lc(i) ((i)<<1)
    #define rc(i) ((i)<<1|1)
    void up(long long x,long long y,long long i)
    {
        if(x!=y)
        {
            ans[i]=min(ans[lc(i)],ans[rc(i)]);
        }
    }
    void down(long long x,long long y,long long i)
    {
        if(x!=y)
        {
            ans[lc(i)]+=lazy[i];
            ans[rc(i)]+=lazy[i];
            lazy[lc(i)]+=lazy[i];
            lazy[rc(i)]+=lazy[i];
            lazy[i]=0;
        }
    }
    void insert(long long x,long long y,long long v,long long l,long long r,long long i)
    {
        down(l,r,i);
        if(x<=l&&r<=y)
        {
            ans[i]+=v;
            lazy[i]+=v;
        }
        else
        {
            long long cnt=inf;
            if(x<=(l+r)/2) insert(x,y,v,l,(l+r)/2,lc(i));
            if((l+r)/2<y) insert(x,y,v,(l+r)/2+1,r,rc(i));
            up(l,r,i);
        }
    }
    long long query(long long x,long long y,long long l,long long r,long long i)
    {
        down(l,r,i);
        if(x<=l&&r<=y) return ans[i];
        else
        {
            long long cnt=inf;
            if(x<=(l+r)/2) cnt=min(cnt,query(x,y,l,(l+r)/2,lc(i)));
            if((l+r)/2<y) cnt=min(cnt,query(x,y,(l+r)/2+1,r,rc(i)));
            return cnt;
        }
    }
public:
    void clear(long long x,long long y)
    {
        left=x;
        right=y;
        memset(ans,0,sizeof(ans));
        memset(lazy,0,sizeof(lazy));
    }
    void insert(long long x,long long y,long long v)
    {
        if(x>y)
        {
            insert(left,y,v,left,right,1);
            insert(x,right,v,left,right,1);
        }
        else insert(x,y,v,left,right,1);
    }
    long long query(long long x,long long y)
    {
        if(x>y) return min(query(left,y,left,right,1),query(x,right,left,right,1));
        else return query(x,y,left,right,1);
    }
}ST;

long long n,m,x,y,v;

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("Circular RMQ.txt","r",stdin);
    #else
    #endif

    while(scanf("%I64d",&n)!=EOF)
    {
        ST.clear(0,n-1);
        for(long long i=0;n>i;i++)
        {
            scanf("%I64d",&v);
            ST.insert(i,i,v);
        }
        scanf("%I64d",&m);
        while(m--)
        {
            scanf("%I64d %I64d",&x,&y);
            if(getchar()==' ')
            {
                scanf("%I64d",&v);
                ST.insert(x,y,v);
            }
            else printf("%I64d\n",ST.query(x,y));
        }
    }

    return 0;
}