SPOJ 3267. D-query （主席树，查询区间有多少个不相同的数）
摘要：
3267. D-queryProblem code: DQUERYEnglishVietnameseGiven a sequence of n numbers a1, a2, ..., anand a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤ j ≤ n). For each d-query (i, j), you have to return the number of distinct elements in the subsequence ai, ai+1, ..., aj.InputLine 1: n (1 ≤ n 阅读全文
posted @ 2013-09-06 12:15 kuangbin 阅读(2468) 评论(0) 推荐(0) 编辑
