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 | 75855 |
44.68%
|
24254 |
83.60%
|
|
|
|
836 - Largest Submatrix | 15016 |
34.96%
|
4663 |
83.74%
|
|
|
|
983 - Localized Summing for Blurring | 3798 |
41.89%
|
1197 |
88.39%
|
|
|
|
10074 - Take the Land | 15207 |
51.48%
|
5043 |
91.85%
|
|
|
|
10667 - Largest Block | 4526 |
66.24%
|
2302 |
96.22%
|
|
|
|
10827 - Maximum sum on a torus | 12346 |
44.56%
|
3723 |
87.75%
|
|
|
|
11951 - Area | 6261 |
44.56%
|
2002 |
92.36%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |