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 | 75860 |
44.68%
|
24258 |
83.61%
|
|
|
|
507 - Jill Rides Again | 34355 |
31.48%
|
8110 |
77.62%
|
|
|
|
836 - Largest Submatrix | 15016 |
34.96%
|
4663 |
83.74%
|
|
|
|
10074 - Take the Land | 15209 |
51.49%
|
5045 |
91.85%
|
|
|
|
10667 - Largest Block | 4526 |
66.24%
|
2302 |
96.22%
|
|
|
|
10684 - The jackpot | 36544 |
49.43%
|
11476 |
94.21%
|
|
|
|
10827 - Maximum sum on a torus | 12347 |
44.56%
|
3724 |
87.76%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |