3. Write a C++ program that would find and print the first longest
ascending or descending subsequence for a vector of integers. For example,
given a vector with
4, 2, 1, 2, 3, 4, 3, 5, 1, 2, 4, 6, 5
the program would find the underlined subsequence and print it.
void printLongestConsecAsending (vector& seq) {
unsigned int i=0;
unsigned int best_start = 0, best_length=1;
unsigned int current_start = 0, current_length=1;
while (i < seq.size()) {
if (seq[i++] > seq[i]) {
current_length++;
if (current_length > best_length) {
best_start = current_start;
best_length = current_length;
}
}
else {
current_start = i;
current_length = 1;
}
}
for (unsigned int i = best_start; icout << seq[i];
}
}