## Codeforces Round 452 – Problem E

Problem E :Segments Removal Statement: You are given an array A of size n.You have to perform following operation until the array becomes empty : find the longest segment of consecutive equal integers (the leftmost, if there are several such segments) and remove it. Compute the number of operations required so that array becomes empty.… Read More »