找出最长连续递增子序列:
{1,9,2,5,7,3,4,6,8,0} 中最长的递增子序列为{3,4,6,8}
#include<iostream>
using namespace std;
int maxLength(int arr[],int length){
int begin=0;
int end=1;
int ans=1;
while(begin<length){
while(arr[end]>arr[end-1]&&end<length){
end++;
}
ans=max(ans,(end-begin));
begin=end;
end=begin+1;
}
return ans;
}
int main(){
int arr[]={1,9,2,5,7,3,4,6,8,0};
cout<<maxLength(arr,10);
return 0;
}