Stack Overflow
Stack Overflow

Questions tagged [lis]

The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible.

The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous, or unique.

Longest increasing subsequences are studied in the context of various disciplines related to mathematics, including algorithmics, random matrix theory, representation theory, and physics.

The longest increasing subsequence problem is solvable in time O(n log n), where n denotes the length of the input sequence.

Reference.

120 questions
1
vote
2 answers

Divide and Conquer algorithm for Longest Increasing Consecutive sequence in an array

Can anyone help me out with this problem that I have been trying to solve for a while. Lets say there is an array A[1,2...n] of numbers and we wish to find the longest increasing consecutive sub sequence with Divide an Conquer method. Specifically…
ArCh3r
  • 89
  • 1
  • 8
1
vote
1 answer

Longest bitonic subsequence in O(n*logn) complexity

A subsequence is bitonic if it monotonically increases and then monotonically de- creases, or if it can be circularly shifted to monotonically increase and then monotonically decrease. Given a sequence, how can I determine the longest bitonic…
HazirBot
  • 323
  • 2
  • 14
1
vote
1 answer

Circular Longest Increasing Subsequence

How can I find the length of Longest Increasing Sub-sequence if the numbers are arranged in circular fashion. For example: LIS of 3, 2, 1 is 3 [1, 2, 3]. P.S I know how to solve Linear LIS in O(nlogn). Problem Source:…
bewithaman
  • 768
  • 8
  • 16
1
vote
2 answers

Can someone explain me why the following algorithm for LIS is not O(n)?

The following code traverses the list once and finds the LIS. I don't see why the DP algorithm should take O(n2). //C int lis(int *a, int l){ if(l == 0) return 1; else if(a[l] > a[l - 1]) return 1 + lis(a, l - 1); else return lis(a, l -…
functional_overflow
  • 927
  • 1
  • 6
  • 8
1
vote
0 answers

How to print out longest increasing subsequence by recursion

Given a sequence of n integer stored in an array, describe a recursive algorithm to print out a subsequence of non-decreasing elements with maximum length. A subsequence may contain non-consecutive elements but they should be ordered in the same way…
anhdt_219
  • 11
  • 2
1
vote
1 answer

why premutation are needed in MCARDS

I was trying to solve MCARDS problem on spoj at http://www.spoj.com/problems/MCARDS/ I know it involves Longest increasing subsequnce logic , but after many attempts I did not figure out solution of this question , so I search for solution I find…
EmptyData
  • 2,386
  • 2
  • 26
  • 42
1
vote
1 answer

Determine which items in an array are part of longest increasing subsequence(s)

This is a variant of the longest increasing subsequence problem. Suppose that, instead of wanting to find a sequence or counting how many sequences there are, you wanted to identify items that can be part of some longest increasing sequence. For…
Craig Gidney
  • 17,763
  • 5
  • 68
  • 136
1
vote
2 answers

What is the most optimized algorithm to find ALL longest increasing subsequence?

I am trying to find ALL longest increasing subsequence of an array. I could manage to find one such LIS in O(n log n) using binary search as suggested on Wikipedia. Can someone help me as how can I extend the same for finding ALL such LIS. I can't…
Naman
  • 2,569
  • 4
  • 27
  • 44
1
vote
1 answer

Longest Increasing Subsequence -- Linear Time Solution?

We can use a stack to keep recording increasing subsequences while iterating the array. The run time is linear because each element enters and leaves the stack once. If we want to output the actual sequence instead of its length, we can record the…
zhe
  • 11
  • 1
0
votes
1 answer

How to make this fenwick tree LIS solution faster?

Longest increasing subsequence, but with fenwick tree Where numbers can be non unique, positive, negative and up to +/- 2^31 Hi tried a lot, and it should work. But its slow. I know that segment trees are supposed to give the O(Nlog N ) solution,…
hopin
  • 23
  • 4
0
votes
0 answers

How to find a line in a file Using pattern and add a new line with modified value in same file with commenting the original line

I have a python file which i am reading and trying to find a pattern using regex once find i am replacing it with empty string like this. def modify_user_code(): regex_a = r"^[a-zA-Z]+\.sql\(\"create database if not exists [a-zA-Z0-9\/_]+…
abhishek jain
  • 1
0
votes
1 answer

How to get multi-dimension specific data samples on the basis of list element?

I need to evaluate my model's performance with limited training data. I am randomly selecting p of original training data. Assume p is 0.2 in this case. Here is some intil lines of code: p = p*100 data_samples = (data.shape[0] * p)/100 #…
Ahmad
  • 645
  • 2
  • 6
  • 21
0
votes
1 answer

I do have a list of dictionaries and I am interested in getting values of only select key

I have used this code on my dataframe of sql queries to obtain list of dictionaries that has select, where, join columns: def augment(x): try: return Parser(x).columns_dict except: pass df_1_joins_where=…
python_pi
  • 95
  • 1
  • 9
0
votes
0 answers

TCP Connection keep disconnecting with Analyzer Mindray BS240

I'm working on a TCP communication program for the chemestry analyzer "Mindray BS240". The problem is that the analyzer keep disconnecting and reconnecting (every 30s). Here is my code, what did I miss ? private void startTcpListner() { …
SidAhmed
  • 2,332
  • 2
  • 25
  • 46
0
votes
2 answers

given a list with integers separated by math symbols, find if a certain value can be calculated by placing braces

I'm trying to write a function which get: An integer. (s) A list with integers separated by math symbols.(L) By using recursion to determinate if the value of s can be calculate from the list by placing braces. Any ideas for a solution? I thought…
Bar.
  • 1
  • 2
1 2 3
4
5 6 7 8