求数组中最长递增子序列(国外英文资料).docVIP

求数组中最长递增子序列(国外英文资料) Take the longest ascending subsequence in the array Write a program that is as low as possible, and find the length of the longest ascending subsequence in a one-dimensional array (N elements). For example, in sequence 1, -1, 2, -3, 4, -5, 6, -7, the longest sequence of increments is 1, 2, 4, 6. Analysis and solution So, depending on the requirement of the question, were going to take the longest sequence of increments in the one-dimensional array, which is the sequence b, [0], b [1], B [m] (0 = b [0] b) b [m] N), so that the array [b [0]] ... Array [b [m]]. Method a , according to a definition we know that there was no aftereffect will each stage according to certain order, for a given phase state, the state of the stages before it cannot directly affect the decision of it in the future, but only indirectly affected by the current state of the. In other words, each state is a complete summary of history. Again, still with the sequence 1, 1, 2, 3, 4, 5, 6, 7, for example, after we found 4, dont care about how the two values of specific before 4, because it does not directly affect find 6. Therefore, this problem satisfies the non-rear-effect, which can be solved by using dynamic programming. You can analyze the target string by Numbers: 1, -1, 2, -3, 4, -5, 6, -7. Use I to represent the location of the current traversal When I = 1, it is clear that the longest sequence is (1) and the sequence length is 1. When I is equal to 2, because negative 1 is less than 1. Therefore, you must discard the first value and reestablish the string. The current increment sequence is (-1) with a length of 1. When I is equal to 3, we have 2 , 1, 2, b1 minus 1. Therefore, the longest ascending sequence is (1, 2), (-1, 2), and the length is 2. In this case, 1 or -1 is not directly affected by the incremental sequence. (but in other cases it might be) After such a push, we come to the following conclusion. Lets say that the length of the longest ascending subseque