hdu5751Eades

链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=5751

题意：统计所有区间中最大值的个数，g[i]表示区间中最大值的个数恰好是i个的区间个数。求sigma(i^g[i])。

分析：这题是学snowy_smile的，他分析的很详细了。我就不再重复一遍了，我把他的线段树换成了rmq。

代码：

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=60010;
const int mod=12345678;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const ll MAX=1ll<<55;
const double eps=1e-5;
const double inf=~0u>>1;
const double pi=acos(-1.0);
typedef double db;
typedef long double ldb;
typedef unsigned int uint;
typedef unsigned long long ull;
vector<int>w[N];
int f[N][20];
ll ANS,ans[N];
void build_rmq(int n) {
    for (int i=1;i<20;i++)
        for (int j=1;j<=n;j++)
        if (j+(1<<i)-1>n) break ;
        else f[j][i]=max(f[j][i-1],f[j+(1<<i-1)][i-1]);
}
int getmax(int l,int r) {
    int g=(int)log2(r-l+1);
    return max(f[l][g],f[r-(1<<g)+1][g]);
}
struct Complex{
    db r,i;
    Complex() {}
    Complex(db r,db i):r(r),i(i) {}
    Complex operator + (const Complex &t) const {
        return Complex(r+t.r,i+t.i);
    }
    Complex operator - (const Complex &t) const {
        return Complex(r-t.r,i-t.i);
    }
    Complex operator * (const Complex &t) const {
        return Complex(r*t.r-i*t.i,r*t.i+i*t.r);
    }
}a[3*N],b[3*N];
void FFT(Complex x[],int n,int rev) {
    int i,j,k,t,ds;
    Complex w,u,wn;
    for (i=1;i<n;i++) {
        for (j=0,t=i,k=n>>1;k;k>>=1,t>>=1) j=j<<1|t&1;
        if (i<j) swap(x[i],x[j]);
    }
    for (i=2,ds=1;i<=n;ds=i,i<<=1) {
        w=Complex(1,0);wn=Complex(cos(rev*2*pi/i),sin(rev*2*pi/i));
        for (j=0;j<ds;j++,w=w*wn)
            for (k=j;k<n;k+=i) {
                u=w*x[k+ds];x[k+ds]=x[k]-u;x[k]=x[k]+u;
            }
    }
    if (rev==-1) for (i=0;i<n;i++) x[i].r/=n;
}
void solve(int l,int r) {
    if (l>r) return ;
    if (l==r) { ans[1]++;return ; }
    int i,num,len=1,L,R,mx=getmax(l,r);
    L=lower_bound(w[mx].begin(),w[mx].end(),l)-w[mx].begin();
    R=upper_bound(w[mx].begin(),w[mx].end(),r)-w[mx].begin()-1;
    if (L>R) return ;
    vector<int>pos;
    pos.push_back(l-1);
    for (i=L;i<=R;i++) pos.push_back(w[mx][i]);
    pos.push_back(r+1);
    num=R-L+2;
    for (i=0;i<num;i++) a[i]=Complex(pos[i+1]-pos[i],0);
    for (i=0;i<num;i++) b[i]=a[num-i-1];
    while (len<2*num) len<<=1;
    for (i=num;i<len;i++) a[i]=b[i]=Complex(0,0);
    FFT(a,len,1);FFT(b,len,1);
    for (i=0;i<len;i++) a[i]=a[i]*b[i];
    FFT(a,len,-1);
    for (i=0;i<num-1;i++) ans[num-i-1]+=(int)(a[i].r+0.5);
    for (i=0;i<num;i++) solve(pos[i]+1,pos[i+1]-1);
}
int main()
{
    int i,n,t;
    scanf("%d", &t);
    while (t--) {
        scanf("%d", &n);
        for (i=1;i<=n;i++) w[i].clear();
        for (i=1;i<=n;i++) {
            scanf("%d", &f[i][0]);
            ans[i]=0;w[f[i][0]].push_back(i);
        }
        build_rmq(n);solve(1,n);
        for (ANS=0,i=1;i<=n;i++) ANS+=i^ans[i];
        printf("%lld\n", ANS);
    }
    return 0;
}