Greedy LIS Algorithm

Alice recently learnt about the [Longest Increasing Subsequence (LIS)](https://en.wikipedia.org/wiki/Longest_increasing_subsequence) problem. She was convinced she found a correct greedy algorithm to solve the problem. Let $A$ be an array of size $N$ for which we want to find the LIS. Then, the code of Alice's algorithm is as follows : ```cpp int alicelis(int A[], int N){ int count = 1;