You are given three integers n, s, and m.

Construct a sequence of length n starting with s, where the elements $a_0, a_1, \dots, a_{n - 1}$ are defined as follows:

• $a_0 = $ s

• For each $i$ from $1$ to n $- 1$:

  • If $i$ is odd, $a_i = a_{i - 1} + $ m

  • If $i$ is even, $a_i = a_{i - 1} - 1$

Return the maximum value present in the sequence.

Constraints:

• $1 \leq$ n, s $\leq 10^9$

• $1 \leq$ m $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.