Maximum Increase.cpp

#include <iostream>

using namespace std;

int main() {

    long n, length = 1;
    cin >> n;
    long ar[n];
    for (int i = 0; i < n; i++)
        cin >> ar[i];
    if (n == 1) {
        cout << "1";
        return 0;
    }
    for (int i = 0; i < n - 1; i++) {
        if (ar[i] < ar[i + 1])
            length++;
        else
            length = 1;
        ar[i] = length;
        if (i == n - 2)
            ar[n - 1] = length;
    }
    long max = ar[0];
    for (int i = 0; i < n; i++) {
        if (ar[i] > max)
            max = ar[i];
    }
    cout << max;

    return 0;
}