Browse Problems 
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
Contribute
Bitcoin:
1ojudgeapLUjJcnUm
ze67a4w3TJ6WnPxo
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 | 76362 |
44.73%
|
24324 |
83.63%
|
|
|
|
836 - Largest Submatrix | 15067 |
34.96%
|
4668 |
83.74%
|
|
|
|
983 - Localized Summing for Blurring | 3804 |
41.90%
|
1200 |
88.42%
|
|
|
|
10074 - Take the Land | 15264 |
51.51%
|
5057 |
91.87%
|
|
|
|
10667 - Largest Block | 4544 |
66.20%
|
2307 |
96.23%
|
|
|
|
10827 - Maximum sum on a torus | 12383 |
44.55%
|
3729 |
87.74%
|
|
|
|
11951 - Area | 6280 |
44.57%
|
2006 |
92.37%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |