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 :: Longest Increasing Subsequence (LIS) - Classical
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
103 - Stacking Boxes | 46488 |
26.84%
|
12448 |
61.40%
|
|
|
111 - History Grading | 36764 |
45.27%
|
13713 |
77.84%
|
|
|
|
231 - Testing the CATCHER | 34388 |
28.50%
|
8729 |
71.55%
|
|
|
|
481 - What Goes Up | 37666 |
27.46%
|
8205 |
74.30%
|
|
|
|
497 - Strategic Defense Initiative | 30701 |
24.31%
|
5861 |
73.52%
|
|
|
|
10051 - Tower of Cubes | 10062 |
37.74%
|
2756 |
83.96%
|
|
|
|
10534 - Wavio Sequence | 23824 |
40.23%
|
4745 |
84.53%
|
|
|
|
11003 - Boxes | 10319 |
33.83%
|
2431 |
80.87%
|
|
|
|
11456 - Trainsorting | 17688 |
33.27%
|
4259 |
81.99%
|
|
|
|
11790 - Murcia's Skyline | 11336 |
44.92%
|
3320 |
94.25%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |