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 | 76514 |
44.75%
|
24342 |
83.63%
|
|
|
|
836 - Largest Submatrix | 15078 |
34.98%
|
4672 |
83.75%
|
|
|
|
983 - Localized Summing for Blurring | 3855 |
41.95%
|
1207 |
88.40%
|
|
|
|
10074 - Take the Land | 15277 |
51.54%
|
5064 |
91.88%
|
|
|
|
10667 - Largest Block | 4544 |
66.20%
|
2307 |
96.23%
|
|
|
|
10827 - Maximum sum on a torus | 12404 |
44.55%
|
3732 |
87.75%
|
|
|
|
11951 - Area | 6285 |
44.61%
|
2010 |
92.39%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |