Blog Archives

SPOJ Inversion Count

Problem Summary: Let A[0…n – 1] be an array of n distinct positive integers. If i A[j] then the pair (i, j) is called an inversion of A. Given n and an array A your task is to find the

Posted in Binary Indexed Tree, SPOJ, UVA