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 | 75480 |
44.68%
|
24215 |
83.61%
|
|
|
|
836 - Largest Submatrix | 14991 |
34.97%
|
4656 |
83.81%
|
|
|
|
983 - Localized Summing for Blurring | 3788 |
41.84%
|
1194 |
88.44%
|
|
|
|
10074 - Take the Land | 15180 |
51.49%
|
5038 |
91.86%
|
|
|
|
10667 - Largest Block | 4518 |
66.25%
|
2298 |
96.26%
|
|
|
|
10827 - Maximum sum on a torus | 12271 |
44.44%
|
3713 |
87.77%
|
|
|
|
11951 - Area | 6218 |
44.61%
|
1996 |
92.38%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |