Problem 1: Longest Increasing Subsequence
Problem Statement: Given an array of integers, find the length of the longest strictly increasing subsequence.
Input
First line contains an integer n, the number of elements. The next line has n space-separated integers.
Output
Print the length of the longest increasing subsequence.
Examples
Input:
8
10 9 2 5 3 7 101 18
Output:
4
Solution in C++
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> lis;
for (int x : arr) {
auto it = lower_bound(lis.begin(), lis.end(), x);
if(it == lis.end()) {
lis.push_back(x);
} else {
*it = x;
}
}
cout << lis.size();
return 0;
}