Problem

You are given an integer array nums representing movie ratings. The ratings can be positive or negative.

Your task is to select a sequence of elements such that:

The sum of selected elements is maximum.

You are allowed to skip elements.

You cannot skip two consecutive elements.

You may skip any number of elements overall, as long as no two skipped elements are adjacent.

Return the maximum possible sum.