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 2: This increases the lower bound of Programming Contests. Again (Steven & Felix Halim) :: Problem Solving Paradigms :: Dynamic Programming :: Longest Increasing Subsequence (LIS)
Title | Total Submissions / Solving % | Total Users / Solving % | ||||
111 - History Grading | 35840 |
45.57%
|
13582 |
77.85%
|
||
231 - Testing the CATCHER | 33564 |
28.39%
|
8669 |
71.50%
|
||
437 - The Tower of Babylon | 20608 |
57.70%
|
5732 |
93.21%
|
||
481 - What Goes Up | 36374 |
27.09%
|
8055 |
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? | 34378 |
42.02%
|
9999 |
87.33%
|
||
10534 - Wavio Sequence | 21970 |
39.90%
|
4517 |
84.48%
|
||
11456 - Trainsorting | 16244 |
33.57%
|
4162 |
81.88%
|
||
11790 - Murcia's Skyline | 10468 |
44.72%
|
3243 |
94.30%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 10 of 10 |