莫队
可爱的泥们
这个作者很懒,什么都没留下…
展开
-
2020-10-13
莫队简单入门题(二) https://vjudge.net/problem/CodeForces-86D An array of positive integers a1, a2, …, an is given. Let us consider its arbitrary subarray al, al + 1…, ar, where 1 ≤ l ≤ r ≤ n. For every positive integer s denote by Ks the number of occurrences of s原创 2020-10-13 16:49:49 · 132 阅读 · 1 评论 -
莫队最简单入门题
莫队–最简单入门题 链接: https://www.spoj.com/problems/DQUERY/en/. 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 su原创 2020-10-13 10:29:16 · 134 阅读 · 0 评论