最长单调递增子序列（O（n2））.rar_company7ne_最长单调递增子序列（动态规划法）

#include<iostream> using namespace std; int LISdyna(int *a, int n) { int i, j, k, b[100], temp; for (i = 1, b[0] = 1; i < n; i++) { for (j = 0, k = 0; j < i; j++) { if (a[j] <= a[i] && k < b[j]) k = b[j]; } b[i] = k + 1; } for (i = 0, temp = 0; i < n; i++) { if (b[i] > temp) temp = b[i]; } return temp; } int main() { int a[100], n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; cout<<LISdyna(a, n)<<endl; system("pause"); }