3480. Maximize Subarrays After Removing One Conflicting Pair

There are n positions 1..n and conflictingPairs [a,b]. A subarray is "valid" if it doesn't contain both points of at least one pair. You may remove one pair from the list. Find the maximum total…