Back to Browse

Maximum Subrectangle Sum Problem

6 views
May 12, 2026
45:05

Optimization of 2D Maximum Subarray Problem into O(N^2 log N) using Struct Segment Trees Code: https://github.com/thisisjoey77/CSLessons/blob/main/BOJ/Diamond/10167.cpp

Download

0 formats

No download links available.

Maximum Subrectangle Sum Problem | NatokHD