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 | 46404 |
26.80%
|
12427 |
61.36%
|
|
|
111 - History Grading | 36366 |
45.46%
|
13684 |
77.86%
|
|
|
|
231 - Testing the CATCHER | 34183 |
28.44%
|
8718 |
71.55%
|
|
|
|
481 - What Goes Up | 37411 |
27.43%
|
8187 |
74.34%
|
|
|
|
497 - Strategic Defense Initiative | 30445 |
24.28%
|
5848 |
73.50%
|
|
|
|
10051 - Tower of Cubes | 9968 |
37.58%
|
2744 |
83.97%
|
|
|
|
10534 - Wavio Sequence | 23554 |
40.21%
|
4710 |
84.59%
|
|
|
|
11003 - Boxes | 10176 |
33.81%
|
2426 |
80.96%
|
|
|
|
11456 - Trainsorting | 17492 |
33.25%
|
4231 |
82.01%
|
|
|
|
11790 - Murcia's Skyline | 11222 |
44.78%
|
3310 |
94.32%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |