g2701_2800.s2736_maximum_sum_queries.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.37

package g2701_2800.s2736_maximum_sum_queries;

// #Hard #Array #Sorting #Binary_Search #Stack #Monotonic_Stack #Segment_Tree #Binary_Indexed_Tree
// #2023_09_23_Time_66_ms_(78.43%)_Space_84.1_MB_(94.12%)

import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.Map;
import java.util.NavigableMap;
import java.util.TreeMap;

public class Solution {
    private void update(NavigableMap map, int num, int sum) {
        Map.Entry entry = map.floorEntry(num);
        while (entry != null && entry.getValue() <= sum) {
            map.remove(entry.getKey());
            int x = entry.getKey();
            entry = map.floorEntry(x);
        }
        entry = map.ceilingEntry(num);
        if (entry == null || entry.getValue() < sum) {
            map.put(num, sum);
        }
    }

    private int queryVal(NavigableMap map, int num) {
        Map.Entry entry = map.ceilingEntry(num);
        if (entry == null) {
            return -1;
        }
        return entry.getValue();
    }

    public int[] maximumSumQueries(int[] nums1, int[] nums2, int[][] queries) {
        int n = nums1.length;
        int m = queries.length;
        List v = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            v.add(new int[] {nums1[i], nums2[i]});
        }
        v.sort(Comparator.comparingInt(a -> a[0]));
        List ind = new ArrayList<>();
        for (int i = 0; i < m; i++) {
            ind.add(i);
        }
        ind.sort((a, b) -> queries[b][0] - queries[a][0]);
        TreeMap values = new TreeMap<>();
        int j = n - 1;
        int[] ans = new int[m];
        for (int i : ind) {
            int a = queries[i][0];
            int b = queries[i][1];
            for (; j >= 0 && v.get(j)[0] >= a; j--) {
                update(values, v.get(j)[1], v.get(j)[0] + v.get(j)[1]);
            }
            ans[i] = queryVal(values, b);
        }
        return ans;
    }
}