https://usaco.guide/problems/cses-1661-subarray-sums-ii/solution STL ordered map data structure used for implementation with N accesses. Each access takes logn. Time complexity should be O(N log N), is incorrectly denoted O(N). Place an "x" in the corresponding checkbox if it is done or...
for just max sum subarray it is Kadane's algorithm in O(n) time, however, I couldn't think of a way to solve for atleast 2 numbers faster than O(n^2). Any idea or a solution?