Лабораторна робота №14 (Завдання 4)

#include <iostream>
#include <windows.h>
#include <vector>

using namespace std;

vector<int> sequence(vector<int> arr, int size);

int main()
{
    SetConsoleOutputCP(1251);
    srand(time(0));
    vector<int> array{};
    int num, i{}, elements, length{};
    elements = rand() % 10 + 3;
    cout << "Згенерований масив: " << endl;
    for (i = 0; i < elements; i++) {
        num = rand() % 10 + 1;
        array.push_back(num);
        cout << num << " ";
    }
    length = array.size();
    vector<int> result = sequence(array, length);
    cout << endl << "Найдовша зростаюча послідовність: " << endl;
    for (i = 0; i < result.size(); i++) {
        cout << result[i] << " ";
    }
}
vector<int> sequence(vector<int> arr, int size)
{
    int i{};
    vector<int> sequence_now, longest_sequence{};
    sequence_now.push_back(arr[0]);
    for (i = 1; i < size; i++) {
        if (arr[i] > arr[i - 1]) {
            sequence_now.push_back(arr[i]);
        }
        else {
            if (sequence_now.size() > longest_sequence.size()) {
                longest_sequence = sequence_now;
            }
            sequence_now.clear();
            sequence_now.push_back(arr[i]);
        }
    }
    if (sequence_now.size() > longest_sequence.size()) {
        longest_sequence = sequence_now;
    }
    return longest_sequence;
}