求最长单调递增子序列

//求最长单调递增子序列#include <iostream>using namespace std;int max_lenth(int arr[],int size){int maxL = 0,j = 0;for (int i = 0;i <  size;i++){for(j = i;j < size && arr[j] < arr[j + 1];j++);if(maxL < j - i + 1)maxL = j - i + 1;}return maxL; }int main(){int a[] = {8,3,1,4,5,6,7,9,18,7,10,12};//6cout << max_lenth(a,12) << endl;return 0;}