一种容易理解的题解

#include <iostream>
using namespace std;
int main(){
    int N;
    cin >> N;
    int a[N];
    for (int i=0;i<=N-1;i++){
        cin >> a[i];
    }
    int ans = 0,lianxu = 0,degree = 0;
    for (int i=0;i<=N-1;i++){
        degree = a[i];
        lianxu = 1;
        for (int j = i+1;j<=N-1;j++){
            if (a[j] > degree){
                lianxu+=1;
                degree = a[j];
            }else break;
        }
        if (lianxu>ans)ans = lianxu;
        
    }
    cout << ans;
    return 0;
}