Codeforces 977F Consecutive Subsequence - Final Answer and Reconstruction

The final answer is $\max(dp[i])$ over all positions, since the longest sequence can end anywhere. To reconstruct the subsequence: track $prev[i]$ for each index.

This records where the sequence jumped from. Start at $best\_end$ (the index with max $dp$ value), follow $prev$ pointers backward, then reverse. Example: if $prev = [-1, 0, 1, -1, 3]$ and $best\_end = 4$, follow $4 \to 3 \to -1$. Collect $[4, 3]$, reverse to get $[3, 4]$.