SPOJ QUERY 主席树(区间不同数字个数)

😊 | Powered By HeartFireY

Problem Analysis

->传送门 a[i]; if(head[a[i]]) nxt[head[a[i]]] = i; head[a[i]] = i; } for(int i = 1; i m; while(m--){ int l, r; cin >> l >> r; cout