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 | 76205 |
44.70%
|
24294 |
83.62%
|
|
|
|
836 - Largest Submatrix | 15030 |
34.96%
|
4666 |
83.73%
|
|
|
|
983 - Localized Summing for Blurring | 3801 |
41.91%
|
1199 |
88.41%
|
|
|
|
10074 - Take the Land | 15240 |
51.50%
|
5050 |
91.86%
|
|
|
|
10667 - Largest Block | 4540 |
66.17%
|
2305 |
96.23%
|
|
|
|
10827 - Maximum sum on a torus | 12366 |
44.56%
|
3729 |
87.74%
|
|
|
|
11951 - Area | 6270 |
44.58%
|
2003 |
92.36%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |