义乌中学暑假集训 2021.07.13 D

#include<bits/stdc++.h>
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
#define W while
#define I inline
#define RI register int
#define LL long long
#define Cn const
#define CI Cn int&
#define gc getchar
#define D isdigit(c=gc())
#define min(x,y) ((x)<(y)?(x):(y))
#define max(x,y) ((x)>(y)?(x):(y))
using namespace std;
namespace Debug{
    Tp I void _debug(Cn char* f,Ty t){cerr<<f<<'='<<t<<endl;}
    Ts I void _debug(Cn char* f,Ty x,Ar... y){W(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
    Tp ostream& operator<<(ostream& os,Cn vector<Ty>& V){os<<"[";for(Cn auto& vv:V) os<<vv<<",";os<<"]";return os;}
    #define gdb(...) _debug(#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
namespace FastIO{
    #define FS 100000
    #define tc() (FA==FB&&(FB=(FA=FI)+fread(FI,1,FS,stdin),FA==FB)?EOF:*FA++)
    #define pc(c) (FC==FE&&(clear(),0),*FC++=c)
    int OT;char oc,FI[FS],FO[FS],OS[FS],*FA=FI,*FB=FI,*FC=FO,*FE=FO+FS;
    I void clear() {fwrite(FO,1,FC-FO,stdout),FC=FO;}
    Tp I void read(Ty& x) {x=0;W(!isdigit(oc=tc()));W(x=(x<<3)+(x<<1)+(oc&15),isdigit(oc=tc()));}
    Ts I void read(Ty& x,Ar&... y) {read(x),read(y...);}
    Tp I void writeln(Ty x) {W(OS[++OT]=x%10+48,x/=10);W(OT) pc(OS[OT--]);pc('\n');}
}using namespace FastIO;
Cn int N=5e5+10;
int n,m,a[N],p[N],v[N],j;
LL Ans[N];
struct Que{int l,r,id;}q[N];
class SegmentTree{
    private:
        struct node{int cnt,sz[2],stk[2],lst,tg;LL Ans;}T[N<<2];
        #define mid (l+r>>1)
        #define PT CI x=1,CI l=1,CI r=n
        #define LT x<<1,l,mid
        #define RT x<<11,mid+1,r
        #define PU(x) (T[x].sz[0]=T[x<<1].sz[0]+T[x<<11].sz[0],T[x].sz[1]=T[x<<1].sz[1]+T[x<<11].sz[1],T[x].Ans=T[x<<1].Ans+T[x<<11].Ans)
        I void PD(CI x,CI l,CI r){
            T[x].stk[T[x].tg]+=j-T[x].lst,T[x].lst=j;
            T[x].Ans+=1LL*T[x].stk[1]*T[x].sz[0]+1LL*T[x].stk[0]*T[x].sz[1];
            if(l<r) T[x<<1].stk[!T[x<<1].tg]+=T[x].stk[1],T[x<<1].stk[T[x<<1].tg]+=T[x].stk[0],T[x<<1].tg^=T[x].tg,
            T[x<<11].stk[!T[x<<11].tg]+=T[x].stk[1],T[x<<11].stk[T[x<<11].tg]+=T[x].stk[0],T[x<<11].tg^=T[x].tg,
            T[x<<1].lst=T[x<<11].lst=j;
            T[x].tg&&(swap(T[x].sz[0],T[x].sz[1]),T[x].tg=0),T[x].stk[0]=T[x].stk[1]=0;
        }
    public:
        I void B(PT){
            if(T[x].sz[0]=r-l+1,l==r) return ;
            B(LT),B(RT);
        }
        I void U(CI L,CI R,PT){
            if(L<=l&&r<=R) return j--,PD(x,l,r),T[x].tg=1,j++,PD(x,l,r),void();
            PD(x,l,r);if(l<r) PD(x<<1,l,mid),PD(x<<11,mid+1,r);
            L<=mid&&(U(L,R,LT),0),R>mid&&(U(L,R,RT),0),PU(x);
        }
        I LL Q(CI L,CI R,PT){
            if(PD(x,l,r),L<=l&&r<=R) return T[x].Ans;
            LL S=0;return L<=mid&&(S+=Q(L,R,LT)),R>mid&&(S+=Q(L,R,RT)),S;
        }
}T;
I bool cmp(Cn Que& x,Cn Que& y){return x.r<y.r;}
int main(){
    RI i;for(read(n),i=1;i<=n;i++) read(a[i]),p[i]=v[a[i]],v[a[i]]=i;
    for(read(m),i=1;i<=m;i++) read(q[i].l,q[i].r),q[i].id=i;
    for(sort(q+1,q+m+1,cmp),T.B(),i=1;i<=m;i++){
        W(j<q[i].r) j++,T.U(p[j]+1,j);
        Ans[q[i].id]=T.Q(q[i].l,q[i].r);
    }for(i=1;i<=m;i++) writeln(Ans[i]);return clear(),0;
}