SPOJ DQUERY - D-query (莫队算法)
Given a sequence of n numbers a1, a2, ..., an and 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 ...
原创
2018-04-11 22:07:00 ·
676 阅读 ·
0 评论