Given a cycle of $n$ vertices and each vertices of the input graph $G$ assigned a weight.
We want to find an independent set of cycle such that weight of the vertices taken in the independent set is maximum.
A brute force way is consider cycle as a set of three consecutive vertices and pick the one with max weight, but the runtime of this algorithm will be $O(2^\frac{n}{3})$.