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: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 3. Problem Solving Paradigms :: Dynamic Programming :: Maximum Sum
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
|
108 - Maximum Sum | 76406 |
44.75%
|
24332 |
83.63%
|
|
|
|
507 - Jill Rides Again | 34976 |
31.74%
|
8137 |
77.63%
|
|
|
|
836 - Largest Submatrix | 15078 |
34.98%
|
4672 |
83.75%
|
|
|
|
10074 - Take the Land | 15273 |
51.53%
|
5062 |
91.88%
|
|
|
|
10667 - Largest Block | 4544 |
66.20%
|
2307 |
96.23%
|
|
|
|
10684 - The jackpot | 36855 |
49.42%
|
11533 |
94.23%
|
|
|
|
10827 - Maximum sum on a torus | 12398 |
44.55%
|
3730 |
87.75%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |


