CF 1456E - XOR-ranges

We are asked to construct an array of length $n$ such that each element lies within a given segment $[li, ri]$ and the sum of costs of consecutive XOR differences is minimized. Each number $x$ has a cost defined by its set bits: the $i$-th bit contributes $ci$ to the cost.