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
Browse Problems
Root :: Competitive Programming 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: Problem Solving Paradigms :: Dynamic Programming :: Longest Increasing Subsequence (LIS)
Title | Total Submissions / Solving % | Total Users / Solving % | ||||
111 - History Grading | 35832 |
45.57%
|
13577 |
77.84%
|
||
231 - Testing the CATCHER | 33515 |
28.37%
|
8668 |
71.49%
|
||
437 - The Tower of Babylon | 20599 |
57.70%
|
5731 |
93.19%
|
||
481 - What Goes Up | 36371 |
27.09%
|
8054 |
74.20%
|
||
497 - Strategic Defense Initiative | 29670 |
24.08%
|
5815 |
73.38%
|
||
1196 - Tiling Up Blocks | 3517 |
39.32%
|
1029 |
91.55%
|
||
10131 - Is Bigger Smarter? | 34366 |
42.02%
|
9995 |
87.32%
|
||
10534 - Wavio Sequence | 21934 |
39.87%
|
4516 |
84.46%
|
||
11368 - Nested Dolls | 4097 |
31.07%
|
1054 |
71.16%
|
||
11456 - Trainsorting | 16189 |
33.58%
|
4161 |
81.88%
|
||
11790 - Murcia's Skyline | 10426 |
44.79%
|
3243 |
94.30%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 11 of 11 |