Maximize Consecutive Elements in an Array After Modification

Given an array where each element can be increased by at most 1, find the largest subset of elements that can be (after optional increments) sorted into a sequence of consecutive integers. The core challenge is picking which elements to increment and which integer interval to target to cover as many elements as possible, with up to 1e5 elements and values up to 1e6.