Improved 3480

Author: javadev

src/main/java/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair/Solution.java

@@ -48,9 +48,7 @@ public long maxSubarrays(int n, int[][] conflictingPairs) {
         // (If there is no candidate pair at j, h[j] remains n+1.)
         for (int j = 1; j <= n; j++) {
             // no conflicting pair at index j
-            // Only if removal would change h[j] (i.e. h[j] < d2[j])
-            // no alternative candidate exists
-            if (h[j] == n + 1 || d2[j] == h[j]) {
+            if (h[j] == n + 1) {
                 continue;
             }
             // Simulate removal: new candidate at j becomes d2[j]

src/test/java/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair/SolutionTest.java

@@ -21,4 +21,11 @@ void maxSubarrays2() {
     void maxSubarrays3() {
         assertThat(new Solution().maxSubarrays(10, new int[][] {{10, 5}, {3, 8}}), equalTo(50L));
     }
+
+    @Test
+    void maxSubarrays4() {
+        assertThat(
+                new Solution().maxSubarrays(25, new int[][] {{9, 7}, {15, 7}, {4, 7}}),
+                equalTo(216L));
+    }
 }