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 :: Longest Increasing Subsequence (LIS) - Classical
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
103 - Stacking Boxes | 46080 |
26.68%
|
12330 |
61.22%
|
|
|
111 - History Grading | 35916 |
45.57%
|
13612 |
77.86%
|
|
|
|
231 - Testing the CATCHER | 33737 |
28.43%
|
8678 |
71.50%
|
|
|
|
481 - What Goes Up | 36541 |
27.19%
|
8079 |
74.22%
|
|
|
|
497 - Strategic Defense Initiative | 29790 |
24.08%
|
5823 |
73.40%
|
|
|
|
10051 - Tower of Cubes | 9709 |
37.66%
|
2726 |
83.97%
|
|
|
|
10534 - Wavio Sequence | 22188 |
39.99%
|
4538 |
84.51%
|
|
|
|
11003 - Boxes | 9706 |
34.34%
|
2399 |
80.95%
|
|
|
|
11456 - Trainsorting | 16482 |
33.55%
|
4170 |
81.89%
|
|
|
|
11790 - Murcia's Skyline | 10765 |
44.79%
|
3259 |
94.32%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |