这是一个合并两个文件的工程，用来将两个文件合并，相同部分保留一次，不同部分一次写入，其中利用了求最大公共子序列的算法-This is a merger of the two files works, used to merge two files, the same part of the reservation time, different parts of the write-once, which demand the greatest advantage of the common s

求取最大连续子序列之和与最大连续子序列，输入在input2.dat文件中，输出在result2文件中-Derive the maximum sum consecutive subsequence with the maximum continuous sub-sequence, enter the input2.dat file, the output file in the result2

输入序列文件 输出第一行为最大连续子序列之和 第二行为最大连续子序列,注意这里可能有多个最大连续子序列，每一个最大连续子序列占一行-Input sequence file output of the first acts of the largest and second consecutive sub-sequences of the greatest acts of continuous sub-sequences, note that there may be more th

java实现，寻找最大连续子序列完整算法，可以找出所有最大连续子序列-java implementation, a complete search algorithm for maximum consecutive subsequence, can find all of the largest sequence of consecutive sub-