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 | 76562 |
44.76%
|
24363 |
83.64%
|
|
|
|
836 - Largest Submatrix | 15083 |
34.97%
|
4672 |
83.75%
|
|
|
|
983 - Localized Summing for Blurring | 3859 |
41.95%
|
1207 |
88.40%
|
|
|
|
10074 - Take the Land | 15281 |
51.55%
|
5067 |
91.89%
|
|
|
|
10667 - Largest Block | 4545 |
66.20%
|
2307 |
96.23%
|
|
|
|
10827 - Maximum sum on a torus | 12409 |
44.55%
|
3733 |
87.76%
|
|
|
|
11951 - Area | 6286 |
44.62%
|
2010 |
92.39%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |