[hdu3333 Turing Tree] 线段树离线 处理区间不同数
题目链接:
[hdu3333 Turing Tree]
题意描述:给定N个数
A1, A2, ..., AN。Q次询问。每次询问要你求区间[L, R]中不同数之和。比如:
求1 1 2 1 3 这五个数 在区间[1, 5] 中不同数之和, 显然答案是1+2+3 = 6.
唠叨一下:这个题目跟昨天晚上在
Codeforces Round #365 (Div. 2) D. Mishka and Interesting sum题目思路是一样的。
解题思路:
首先,离线处理询问。对询问按照区间右端点进行排序。
然后,从左向右处理询问, 挨个挨个将Ai 放到线段树中,并且记录下Ai的位置,记为pos[Ai],如果Ai在之前出现过,那么在线段树中将pos[Ai] 置为0。
最后,线段树求和,答案保存起来。
#include <map>
#include <cmath>
#include <queue>
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <algorithm>
using namespace std;
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#define FIN freopen("input.txt","r",stdin)
#define FOUT freopen("output.txt","w",stdout)
#define fst first
#define snd second
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
typedef __int64 LL;
//typedef long long LL;
typedef pair<int, int> PII;
const int MAXN = 30000 + 5;
const int MAXQ = 100000 + 5;
struct Node {
int L, R, ID;
Node () {}
Node (int L, int R, int ID) : L (L), R (R), ID (ID) {}
bool operator < (const Node& e) const {
if(R == e.R) return L < e.L;
return R < e.R;
}
} inp[MAXQ];
int T, N, Q;
int A[MAXN];
LL seg[MAXN << 2];
LL res[MAXQ];
map<int, int> pos;
inline void pushUp (const int& rt) {
seg[rt] = seg[rt << 1] + seg[rt << 1 | 1];
}
void build (int l, int r, int rt) {
memset (seg, 0x00, sizeof (seg) );
}
LL query (int L, int R, int l, int r, int rt) {
if (L <= l && r <= R) {
return seg[rt];
}
int mid = (l + r) >> 1;
LL ret = 0LL;
if (L <= mid) ret += query (L, R, lson);
if (R > mid) ret += query (L, R, rson);
return ret;
}
void update (int p, int v, int l, int r, int rt) {
if (l == r) {
seg[rt] = v;
return;
}
int mid = (l + r) >> 1;
if (p <= mid) update (p, v, lson);
else update (p, v, rson);
pushUp (rt);
}
int main() {
#ifndef ONLINE_JUDGE
FIN;
#endif // ONLINE_JUDGE
int L, R, ID;
scanf ("%d", &T);
while (T --) {
scanf ("%d", &N);
for (int i = 1; i <= N; i++) {
scanf ("%d", &A[i]);
}
scanf ("%d", &Q);
for (int i = 1; i <= Q; i++) {
scanf ("%d %d", &inp[i].L, &inp[i].R);
inp[i].ID = i;
}
sort (inp + 1, inp + Q + 1);
pos.clear();
build (1, N, 1);
LL temp;
for (int i = 1, lst = 1, p; i <= Q; i++) {
L = inp[i].L, R = inp[i].R, ID = inp[i].ID;
while (lst <= R) {
p = pos[A[lst]];
if (p) {
update (p, 0, 1, N, 1);
}
update (lst, A[lst], 1, N, 1);
pos[A[lst]] = lst;
lst ++;
}
temp = query (L, R, 1, N, 1);
res[ID] = temp;
}
for(int i = 1; i <= Q; i++) {
printf ("%I64d\n", res[i]);
}
}
return 0;
}