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
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 | 76665 |
44.78%
|
24391 |
83.65%
|
|
|
|
836 - Largest Submatrix | 15093 |
34.98%
|
4674 |
83.76%
|
|
|
|
983 - Localized Summing for Blurring | 3863 |
42.01%
|
1209 |
88.42%
|
|
|
|
10074 - Take the Land | 15299 |
51.57%
|
5074 |
91.88%
|
|
|
|
10667 - Largest Block | 4549 |
66.23%
|
2309 |
96.23%
|
|
|
|
10827 - Maximum sum on a torus | 12440 |
44.59%
|
3737 |
87.77%
|
|
|
|
11951 - Area | 6319 |
44.63%
|
2013 |
92.40%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |
Browse Problems 

