codeforces 301D Yaroslav and Divisors（樹狀數組）

Yaroslav has an array p = p1, p2, ..., pn (1 ≤ pi ≤ n), consisting of n distinct integers. Also, he has m queries:html   Query number i is represented as a pair of integers li, ri (1 ≤ li ≤ ri ≤ n). T

>>阅读原文<<