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 | 76640 |
44.77%
|
24387 |
83.65%
|
|
|
|
507 - Jill Rides Again | 35058 |
31.76%
|
8152 |
77.67%
|
|
|
|
836 - Largest Submatrix | 15092 |
34.98%
|
4674 |
83.76%
|
|
|
|
10074 - Take the Land | 15295 |
51.55%
|
5074 |
91.88%
|
|
|
|
10667 - Largest Block | 4548 |
66.23%
|
2309 |
96.23%
|
|
|
|
10684 - The jackpot | 37010 |
49.44%
|
11567 |
94.25%
|
|
|
|
10827 - Maximum sum on a torus | 12436 |
44.57%
|
3736 |
87.77%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |