Manish Kumar
Manish Kumar
I would like to add O(nlogn) implementation of Longest Increasing Subsequence in an array. #### This issue is about [Algo/LongestIncreasingSubsequence] [C++] in nlogn (http://codeforces.com/blog/entry/12274). - [x] Issue Title is in...
#### This issue is about [Algo/DS Name](link to resource for the Algo/DS). Link: https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes#Segmented_sieve - [x] Issue Title is in form `Algo/DS Name [Language]`. - [x] I searched or browsed...
- [ ] Issue Title is in form `Problem Code (Contest Code) [Language]` - [ ] I ensure I'm Eligible as per [ECR](https://github.com/iiitv/ChefLib/blob/master/README.md#ecr). - [ ] I got AC for...
- [x] Issue Title is in form `Problem Code (Contest Code) [Language]` - [x] I ensure I'm Eligible as per [ECR](https://github.com/iiitv/ChefLib/blob/master/README.md#ecr). - [x] I got AC for this problem when...