HDU_3874 求连续不重复元素之和（莫队算法/树状数组）

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=50010,M=200010;
int n,m,tot;
ll a[N],ans[M],C[N];
int vis[N<<5];
typedef struct node{
	int l,r,num;
	void read(){
		scanf("%d%d",&l,&r);
	}
	bool operator < (const node& p) const {
		return (r < p.r||(r==p.r&&l<p.l));
	}
}node;
node q[M];

int lowbit(int x){return x&(-x);}

void update(int x,ll c){
	while(x<=n) C[x]+=c,x+=lowbit(x);
}

ll getsum(int x){
	ll r=0;
	while(x>0) r+=C[x],x-=lowbit(x);
	return r;
}
int main(){
	//freopen("1.in","r",stdin);
	//freopen("1.out","w",stdout);
	int i,j,k;
	int T,cas=1;
	for(scanf("%d",&T);cas<=T;cas++){
		scanf("%d",&n);
		for(i=1;i<=n;i++) scanf("%lld",&a[i]);
		scanf("%d",&m);
		for(i=1;i<=m;i++) q[i].read(),q[i].num=i;
		sort(q+1,q+m+1);
		memset(vis,0,sizeof(vis));
		memset(C,0,sizeof(C));
		memset(ans,0,sizeof(ans));
		for(i=k=1;i<=n;i++){
			if(vis[a[i]]) update(vis[a[i]],-a[i]);
			update(vis[a[i]]=i,a[i]);
			while(q[k].r==i){
				ans[q[k].num]+=getsum(i)-getsum(q[k].l-1);
				k++;
			}
		}
		for(i=1;i<=m;i++) printf("%lld\n",ans[i]);
	}
	return 0;
}

 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 50010;
struct node{
    int l, r, id;
} Q[N*4];
int n, m, unit;
int a[N], num[N*20];
ll tmp, ans[N*4];
void add(int x)
{
    if(num[x] == 0) tmp += x;
    num[x]++;
}
void del(int x)
{
    num[x]--;
    if(num[x] == 0) tmp -= x;
}
void solve()
{
    unit = (int)sqrt(1.0*n);
    memset(num, 0, sizeof num);
    sort(Q+1, Q+1+m, [](node a, node b){
            return a.l/unit != b.l/unit ? a.l/unit < b.l/unit : a.r < b.r;
        }
    );
    int l = 1, r = 0;
    tmp = 0;
    for(int i = 1; i <= m; i++)
    {
        while(r < Q[i].r) add(a[++r]);
        while(r > Q[i].r) del(a[r--]);
        while(l < Q[i].l) del(a[l++]);
        while(l > Q[i].l) add(a[--l]);
        ans[Q[i].id] = tmp;
    }
    for(int i = 1; i <= m; i++) printf("%lld\n", ans[i]);
}
int main()
{
    int t;
    for(scanf("%d",&t);t>0;t--){
        scanf("%d", &n);
        for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
        scanf("%d", &m);
        for(int i = 1; i <= m; i++) scanf("%d%d", &Q[i].l, &Q[i].r), Q[i].id = i;
        solve();
    }
    return 0;
}