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 | 73558 |
44.64%
|
23825 |
83.56%
|
|
|
|
507 - Jill Rides Again | 32940 |
31.22%
|
7971 |
77.48%
|
|
|
|
836 - Largest Submatrix | 14835 |
35.00%
|
4631 |
83.74%
|
|
|
|
10074 - Take the Land | 14768 |
51.31%
|
4956 |
91.83%
|
|
|
|
10667 - Largest Block | 4469 |
66.12%
|
2280 |
96.23%
|
|
|
|
10684 - The jackpot | 34820 |
49.56%
|
11240 |
94.25%
|
|
|
|
10827 - Maximum sum on a torus | 11978 |
44.41%
|
3662 |
87.79%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |