Our Patreons
Diamond Sponsors
Steven & Felix Halim
Reinardus Pradhitya
Gold Sponsors
--- YOUR NAME HERE ----
Silver Sponsors
--- YOUR NAME HERE ----
Bronze Sponsors
Christianto Handojo
Krzysztof Adamek
Fatima Broom
Browse Problems
Root :: Competitive Programming 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: Problem Solving Paradigms :: Dynamic Programming :: Max 2D Range Sum
Title | Total Submissions / Solving % | Total Users / Solving % | ||||
![]() |
108 - Maximum Sum | 74139 |
44.63%
|
23947 |
83.56%
|
|
![]() |
836 - Largest Submatrix | 14878 |
34.98%
|
4639 |
83.77%
|
|
![]() |
983 - Localized Summing for Blurring | 3745 |
41.95%
|
1183 |
88.50%
|
|
![]() |
10074 - Take the Land | 14906 |
51.44%
|
4983 |
91.83%
|
|
![]() |
10667 - Largest Block | 4481 |
66.19%
|
2285 |
96.24%
|
|
![]() |
10827 - Maximum sum on a torus | 12129 |
44.41%
|
3688 |
87.83%
|
|
![]() |
11951 - Area | 5912 |
44.44%
|
1967 |
92.37%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 7 of 7 |