Longest Increasing Subsequence

Problem DescriptionWavio is a sequence of integers. It has some interesting properties. • Wavio is of odd length i.e. L = 2 ∗ n + 1. • The first (n + 1) integers of Wavio sequence makes a strictly in

[UVa 1626]Brackets sequence