HDU 3333 Turing Tree

离线处理+树状数组。。

用map来标记，避免了开大数组。。

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
using namespace std;
#define ll long long
#define ull unsigned long long
#define eps 1e-8
#define inf 0x3f3f3f3f
#define lson l, m, rt << 1
#define rson m+1, r, rt << 1 | 1
#define mnx 33333
ll a[mnx], ans[mnx<<2], c[mnx];	
int n, m;
map< ll, int > vis;
struct query{
	int l, r, id;
	bool operator < ( const query & b ) const{
		return r < b.r;
	}
}ch[mnx<<2];
int lowbit( int x ){
	return x&(-x);
}
ll sum( int x ){
	ll ret = 0;
	while( x > 0 ){
		ret += c[x], x -= lowbit( x );
	}
	return ret;
}
void add( int x, ll d ){
	while( x <= n ){
		c[x] += d, x += lowbit( x );
	}
}
int main(){
	int cas;
	scanf( "%d", &cas );
	while( cas-- ){
		vis.clear();
		memset( c, 0, sizeof(c) );
		scanf( "%d", &n );
		for( int i = 1; i <= n; i++ ){
			scanf( "%I64d", &a[i] );
		} 
		scanf( "%d", &m );
		for( int i = 0; i < m; i++ ){
			scanf( "%d%d", &ch[i].l, &ch[i].r );
			ch[i].id = i;
		}
		sort( ch, ch+m );
		int j = 0;
		for( int i = 1; i <= n; i++ ){
			add( i, a[i] );
			if( vis[a[i]] > 0 ){
				add( vis[a[i]], -a[i] );
			}
			vis[a[i]] = i;
			while( j < m && ch[j].r == i ){
				ans[ch[j].id] = sum( ch[j].r ) - sum( ch[j].l-1 );
				j++;
			}
		}
		for( int i = 0; i < m; i++ ){
			printf( "%I64d\n", ans[i] );
		}
	}
	return 0;
}