我的代码

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

int a[1000005], cnt[1000005];

int main()
{
    memset(cnt, 1, sizeof(cnt));
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }
    for (int i = 2; i <= n; ++i)
    {
        if (a[i] > a[i - 1]) cnt[i] = cnt[i - 1] + 1;
    }
    int maxn = 0;
    for (int i = 1; i <= n; ++i)
    {
        maxn = max(maxn, cnt[i]);
    }
    cout << maxn;
}