Falling Squares — C++

// Time:  O(nlogn)
// Space: O(n)

class Solution {
public:
    vector<int> fallingSquares(vector<vector<int>>& positions) {
        vector<int> result;
        map<int, int> heights;
        int maxH = heights[-1] = 0;
        for (const auto& p : positions) {
            auto it0 = heights.upper_bound(p[0]);
            auto it1 = heights.lower_bound(p[0] + p[1]);
            int h0 = prev(it0)->second;
            int h1 = prev(it1)->second;
            for (auto it = it0; it != it1; ++it) {
                h0 = max(h0, it->second);
            }
            heights.erase(it0, it1);
            heights[p[0]] = h0 + p[1];
            heights[p[0] + p[1]] = h1;
            maxH = max(maxH, h0 + p[1]);
            result.emplace_back(maxH);
        }
        return result;
    }
};

// Time:  O(nlogn)
// Space: O(n)
// Segment Tree solution.
class Solution2 {
public:
    vector<int> fallingSquares(vector<vector<int>>& positions) {
        set<int> index;
        for (const auto& position : positions) {
            index.emplace(position[0]);
            index.emplace(position[0] + position[1] - 1);
        }
        SegmentTree tree(index.size());
        auto max_height = 0;
        vector<int> result;
        for (const auto& position : positions) {
            const auto L = distance(index.begin(), index.find(position[0]));
            const auto R = distance(index.begin(), index.find(position[0] + position[1] - 1));
            const auto h = tree.query(L, R) + position[1];
            tree.update(L, R, h);
            max_height = max(max_height, h);
            result.emplace_back(max_height);
        }
        return result;
    }

private:
    class SegmentTree {
    public:
        SegmentTree(int N)
            : N_(N),
              tree_(2 * N),
              lazy_(N)
        {
            H_ = 1;
            while ((1 << H_) < N) {
                ++H_;
            }
        }

        void update(int L, int R, int h) {
            L += N_; R += N_;
            int L0 = L, R0 = R;
            while (L <= R) {
                if ((L & 1) == 1) {
                    apply(L++, h);
                }
                if ((R & 1) == 0) {
                    apply(R--, h);
                }
                L >>= 1; R >>= 1;
            }
            pull(L0); pull(R0);
        }

        int query(int L, int R) {
            L += N_; R += N_;
            auto result = 0;
            push(L); push(R);
            while (L <= R) {
                if ((L & 1) == 1) {
                    result = max(result, tree_[L++]);
                }
                if ((R & 1) == 0) {
                    result = max(result, tree_[R--]);
                }
                L >>= 1; R >>= 1;
            }
            return result;
        }

    private:
        int N_, H_;
        vector<int> tree_, lazy_;

        void apply(int x, int val) {
            tree_[x] = max(tree_[x], val);
            if (x < N_) {
                lazy_[x] = max(lazy_[x], val);
            }
        }

        void pull(int x) {
            while (x > 1) {
                x >>= 1;
                tree_[x] = max(tree_[x * 2], tree_[x * 2 + 1]);
                tree_[x] = max(tree_[x], lazy_[x]);
            }
        }

        void push(int x) {
            for (int h = H_; h > 0; --h) {
                int y = x >> h;
                if (lazy_[y] > 0) {
                    apply(y * 2, lazy_[y]);
                    apply(y * 2 + 1, lazy_[y]);
                    lazy_[y] = 0;
                }
            }
        }
    };
};


// Time:  O(n * sqrt(n))
// Space: O(n)
class Solution3 {
public:
    vector<int> fallingSquares(vector<vector<int>>& positions) {
        set<int> index;
        for (const auto& position : positions) {
            index.emplace(position[0]);
            index.emplace(position[0] + position[1] - 1);
        }
        const auto W = index.size();
        const auto B = static_cast<int>(sqrt(W));
        vector<int> heights(W);
        vector<int> blocks(B + 2), blocks_read(B + 2);
        
        auto max_height = 0;
        vector<int> result;
        for (const auto& position : positions) {
            const auto L = distance(index.begin(), index.find(position[0]));
            const auto R = distance(index.begin(), index.find(position[0] + position[1] - 1));
            const auto h = query(B, L, R, heights, blocks, blocks_read) + position[1];
            update(B, h, L, R, &heights, &blocks, &blocks_read);
            max_height = max(max_height, h);
            result.emplace_back(max_height);
        }
        return result;
    }

private:
    int query(const int B,
              int left, int right,
              const vector<int>& heights,
              const vector<int>& blocks, const vector<int>& blocks_read) {
        int result = 0;
        while (left % B > 0 && left <= right) {
            result = max(result, max(heights[left], blocks[left / B]));
            result = max(result, blocks[left / B]);
            ++left;
        }
        while (right % B != B - 1 && left <= right) {
            result = max(result, max(heights[right], blocks[right / B]));
            --right;
        }
        while (left <= right) {
            result = max(result, max(blocks[left / B], blocks_read[left / B]));
            left += B;
        }
        return result;
    }

    void update(const int B, const int h,
                int left, int right,
                vector<int> *heights,
                vector<int> *blocks, vector<int> *blocks_read) {
        while (left % B > 0 && left <= right) {
            (*heights)[left] = max((*heights)[left], h);
            (*blocks_read)[left / B] = max((*blocks_read)[left / B], h);
            ++left;
        }
        while (right % B != B - 1 && left <= right) {
            (*heights)[right] = max((*heights)[right], h);
            (*blocks_read)[right / B] = max((*blocks_read)[right / B], h);
            --right;
        }
        while (left <= right) {
            (*blocks)[left / B] = max((*blocks)[left / B], h);
            left += B;
        }
    }
};


// Time:  O(n^2)
// Space: O(n)
class Solution4 {
public:
    vector<int> fallingSquares(vector<vector<int>>& positions) {
        vector<int> heights(positions.size());
        for (int i = 0; i < positions.size(); ++i) {
            int left_i = positions[i][0], size_i = positions[i][1];
            int right_i = left_i + size_i;
            heights[i] += size_i;
            for (int j = i + 1; j < positions.size(); ++j) {
                int left_j = positions[j][0], size_j = positions[j][1];
                int right_j = left_j + size_j;
                if (left_j < right_i and left_i < right_j) {  // intersect
                    heights[j] = max(heights[j], heights[i]);
                }
            }
        }

        vector<int> result;
        for (const auto& height : heights) {
            result.emplace_back(result.empty() ? height : max(result.back(), height));
        }
        return result;
    }
};