Algorithm exercises---DP to solve the longest ascending subsequence (LIS)

description of the problem:

For 2,5,3,1,9,4,6,8,7, find out the number of longest ascending subsequence

Longest ascending subsequence definition:

For I<j I,J∈A[0...N] Meet A[i]<a[j]

1. Find the DP formula:
Dp[i] = Dp[j] + 1 (j<i && a[j]<a[i] && Dp[i] < dp[j]+1)


2. Implementing the Code

void Main () {dp_lis (); Console.WriteLine (Dparr);} Static int[] arr = new Int[9]{2,5,3,1,9,4,6,8,7};static int n = 9;static int[] Dparr = new int[9];static void Dp_lis () {for (Var i= 0;i < n; i++) {Dparr[i] = 1;for (var j = 0;j < I; j + +) {if (Arr[j]<arr[i] && dparr[i] < Dparr[j] + 1) {Dparr[i]  = Dparr [J]+1;}}}

Dparr[0...n-1], the largest element is the request.

As a connection, this example prints out all the elements in the DP array

Algorithm exercises---DP to solve the longest ascending subsequence (LIS)