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 | 76090 |
44.69%
|
24292 |
83.61%
|
|
|
|
836 - Largest Submatrix | 15021 |
34.96%
|
4664 |
83.75%
|
|
|
|
983 - Localized Summing for Blurring | 3799 |
41.91%
|
1198 |
88.40%
|
|
|
|
10074 - Take the Land | 15222 |
51.50%
|
5048 |
91.86%
|
|
|
|
10667 - Largest Block | 4539 |
66.16%
|
2304 |
96.22%
|
|
|
|
10827 - Maximum sum on a torus | 12360 |
44.57%
|
3728 |
87.77%
|
|
|
|
11951 - Area | 6267 |
44.58%
|
2002 |
92.36%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |