📊 LIS — Longest Increasing Subsequence
USACO C++ Book · Interactive Visualizer
📈 Longest Increasing Subsequence (LIS)
A=[3,1,4,1,5,9,2,6]
Step 0/10
📊 Graph
i=0
i=1
i=2
i=3
i=4
i=5
i=6
i=7
3
1
4
1
5
9
2
6
dp[0]
dp[1]
dp[2]
dp[3]
dp[4]
dp[5]
dp[6]
dp[7]
-
-
-
-
-
-
-
-
LIS = [1, 4, 5, 6], length = 4
🗂 Data Structures
💻 Code
Click Next Step to start
◀ Prev
Next Step ▶
↺ Reset
0/10
Keyboard:
→
Next
←
Prev
R
Reset