Leetcode 3480. Maximize Subarrays After Removing One Conflicting Pair

Given nums = [1..n] and a set of conflicting pairs [a,b] that forbid any subarray containing both a and b, remove exactly one pair to maximize the number of non-empty subarrays that contain no remaining conflicting pair. The core challenge is to efficiently count (and maximize) valid subarrays after deleting one constraint, under constraints up to n = 1e5 and m = O(n).