The Organized Shop

ALL

The owner of HackerMall love$-$ prennignel items. A row of items is organized if the is different for each adjacent stack of items. To organize the row, half of the items in any stack can be removed. This can happen as many times and on as many stacks as is required. Determine the minimum number of operations needed to organize a row.

More formally, given an array items of integer of length $n,$ the array is organized if for each $x$ less than $n-1,$ items $[x]mod2$i tems $[x+1]mod2.$ A mod $B$ is the remainder of A divided by $B.$ In one operation, the owner can choose an element and divide it by $2.$ That is$,$ if one chooses index $x$ then do items $[x]=$ floor $($items $\frac{x}{2}).$ The goal is to return the minimum number of operations that one needs to perform to organize the array.

Example

items $=[4,10,10,6,2]$

The array is not organized since, for example, items$[2]$ mod $2=$ items$[3]$ mod$2.$

One way to organize the array is shown using $1$ based indexing.