传送门:http://www.lydsy.com:808/JudgeOnline/problem.php?id=2453
一句话,区间不重复元素个数,如果颜色少的话可以状压,颜色多的话维护每种颜色的pre值,询问[l,r]也就是询问区间中<l的pre个数
Code:
#include<bits/stdc++.h>
#define rnd() ((rand()<<16)|rand())
using namespace std;
const int maxn=1e5+10;
map<int,int>M,mp;
set<int>S[maxn<<1];
int pre[maxn],nxt[maxn],n,m,a[maxn];
struct Treap{
struct node;
node *root,*Null;
struct node{
int val,key,size,s;
node *c[2......
阅读全文