Codeforces Round #182 (Div. 1) Yaroslav and Divisors(离线+树状数组)

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

>>阅读原文<<