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 | 75697 |
44.69%
|
24236 |
83.62%
|
|
|
|
836 - Largest Submatrix | 15005 |
34.98%
|
4659 |
83.79%
|
|
|
|
983 - Localized Summing for Blurring | 3795 |
41.90%
|
1195 |
88.45%
|
|
|
|
10074 - Take the Land | 15195 |
51.50%
|
5041 |
91.87%
|
|
|
|
10667 - Largest Block | 4522 |
66.23%
|
2299 |
96.26%
|
|
|
|
10827 - Maximum sum on a torus | 12343 |
44.56%
|
3722 |
87.78%
|
|
|
|
11951 - Area | 6240 |
44.55%
|
1998 |
92.39%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |