贴一个最长连续上升子序列的模板:
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a[100005];
scanf("%d",&n);
for(int i = 0 ;i < n;i++)
scanf("%d",&a[i]);
int len = 1,maxn = 1;
for(int i = 0;i < n-1;i++){
if(a[i+1] > a[i]) len++;
else len = 1;
maxn = max(maxn,len);
}
printf("%d\n",maxn);
return 0;
}