We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1c2cc20 commit 75fb127Copy full SHA for 75fb127
src/main/java/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair/Solution.java
@@ -40,7 +40,7 @@ public long maxSubarrays(int n, int[][] cp) {
40
} else {
41
firstEntry.getValue().remove(0);
42
}
43
- long covered = n - smallestEnd + 1;
+ long covered = n - smallestEnd + 1L;
44
totalPossible -= covered;
45
if (endPointMap.isEmpty()) {
46
contributions[pairIndex] += covered;
0 commit comments