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: 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 | 75487 |
44.69%
|
24216 |
83.61%
|
|
|
|
507 - Jill Rides Again | 34078 |
31.39%
|
8081 |
77.58%
|
|
|
|
836 - Largest Submatrix | 14991 |
34.97%
|
4656 |
83.81%
|
|
|
|
10074 - Take the Land | 15183 |
51.49%
|
5039 |
91.86%
|
|
|
|
10667 - Largest Block | 4518 |
66.25%
|
2298 |
96.26%
|
|
|
|
10684 - The jackpot | 36298 |
49.47%
|
11457 |
94.21%
|
|
|
|
10827 - Maximum sum on a torus | 12271 |
44.44%
|
3713 |
87.77%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |