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 | 75077 |
44.65%
|
24119 |
83.60%
|
|
|
|
507 - Jill Rides Again | 33877 |
31.38%
|
8054 |
77.54%
|
|
|
|
836 - Largest Submatrix | 14979 |
34.98%
|
4654 |
83.80%
|
|
|
|
10074 - Take the Land | 15094 |
51.45%
|
5019 |
91.85%
|
|
|
|
10667 - Largest Block | 4505 |
66.24%
|
2291 |
96.25%
|
|
|
|
10684 - The jackpot | 36044 |
49.50%
|
11407 |
94.21%
|
|
|
|
10827 - Maximum sum on a torus | 12253 |
44.41%
|
3703 |
87.82%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |