Program design ideas:
D.P
1. First establish a relational table: size prejudice relationship. Only less than the relationship can go (upper triangle matrix). The diagonal is initialized to 1.
2. Retrospective: From the top triangle matrix from bottom to top the maximum.
3. The above program is not given a child sequence: Simply find the maximum element of each row in the final matrix, which is the element in LIS.
4. Eventually there may be multiple paths: because there may be multiple LIS.
D.P
1. First establish a relational table: size prejudice relationship. Only less than the relationship can go (upper triangle matrix). The diagonal is initialized to 1.
2. Retrospective: From the top triangle matrix from bottom to top the maximum.
3. The above program is not given a child sequence: Simply find the maximum element of each row in the final matrix, which is the element in LIS.
4. Eventually there may be multiple paths: because there may be multiple LIS.
D.P
1. First establish a relational table: size prejudice relationship. Only less than the relationship can go (upper triangle matrix). The diagonal is initialized to 1.
2. Retrospective: From the top triangle matrix from bottom to top the maximum.
3. The above program is not given a child sequence: Simply find the maximum element of each row in the final matrix, which is the element in LIS.
4. Eventually there may be multiple paths: because there may be multiple LIS.
D.P
1. First establish a relational table: size prejudice relationship. Only less than the relationship can go (upper triangle matrix). The diagonal is initialized to 1.
2. Retrospective: From the top triangle matrix from bottom to top the maximum.
3. The above program is not given a child sequence: Simply find the maximum element of each row in the final matrix, which is the element in LIS.
4. Eventually there may be multiple paths: because there may be multiple LIS.
PLZ Enjoy!
