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 | 76390 |
44.74%
|
24330 |
83.63%
|
|
|
|
836 - Largest Submatrix | 15077 |
34.97%
|
4671 |
83.75%
|
|
|
|
983 - Localized Summing for Blurring | 3815 |
41.91%
|
1205 |
88.38%
|
|
|
|
10074 - Take the Land | 15273 |
51.53%
|
5062 |
91.88%
|
|
|
|
10667 - Largest Block | 4544 |
66.20%
|
2307 |
96.23%
|
|
|
|
10827 - Maximum sum on a torus | 12386 |
44.56%
|
3729 |
87.74%
|
|
|
|
11951 - Area | 6282 |
44.59%
|
2007 |
92.38%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |