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 | 73975 |
44.63%
|
23918 |
83.55%
|
|
|
|
836 - Largest Submatrix | 14855 |
34.98%
|
4634 |
83.75%
|
|
|
|
983 - Localized Summing for Blurring | 3737 |
41.99%
|
1181 |
88.57%
|
|
|
|
10074 - Take the Land | 14868 |
51.44%
|
4974 |
91.84%
|
|
|
|
10667 - Largest Block | 4480 |
66.18%
|
2284 |
96.23%
|
|
|
|
10827 - Maximum sum on a torus | 12118 |
44.39%
|
3683 |
87.81%
|
|
|
|
11951 - Area | 5901 |
44.47%
|
1964 |
92.36%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |