Leetcode 2382. Maximum Segment Sum After Removals

Given an array and an order of index removals that zero out elements and split the array into contiguous positive segments, return the maximum segment sum after each removal. The core challenge is to maintain and update contiguous segment sums under dynamic deletions (n up to 1e5) — typically solved by reversing the process and using a union-find or similar structure to merge segments and track the running maximum.