排序算法(Java)

0707添加桶排序 桶排序参考链接 排序分类内排序和外排序。在排序过程中,全部记录存放在内存,则称为内排序,如果排序过程中需要使用外存(并不是不需要内存),则称为外排序。 时间复杂度     继续阅读
MXlwq's avatar
MXlwq 4月 19, 2016
 | 

POJ1458动态规划

Common SubsequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 46006 Accepted: 18845 DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, …, xm > another sequence Z = < z1, z2, …, zk > is a subsequence of X if there exists a strictly increasing sequence < i1, i2, …, ik > of indices of X such that for all j = 1,2,…,k, xij = zj. For example, Z = < a, b, f, c > is a subsequence of X = < a, b, c, f, b, c > with index sequence < 1, 2, 4, 6 >. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y. InputThe program input is from the std input. Each data set in the input contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. OutputFor each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line. Sample Inputabcfbc abfcabprogramming contest abcd mnpSample Output42 0 分析最长公共子序列,题目意思是给出两个字符串,求他们的最长公共子序列LCS的入门题 模板     继续阅读
MXlwq's avatar
MXlwq 4月 09, 2016
 | 

POJ1163动态规划

TopCoder文章:Dynamic Programming: From novice to advanced The TriangleTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 43089 Accepted: 26054Description    7   3  8  8  1  0 2  7  4  44  5  2  6  5  (Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the left or diagonally down to the right. InputYour program is to read from standard input. The first line contains one integer N: the number of rows in the triangle. The following N lines describe the data of the triangle. The number of rows in the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.Output Your program is to write to standard output. The highest sum is written as an integer. Sample Input573 88 1 02 7 4 44 5 2 6 5 Sample Output30 分析简单动态规划,这道题如果用枚举法,在数塔层数稍大的情况下,则需要列举出的路径条数将是一个非常庞大的数目,最终会导致TLE。因此我们可以从下往上推,相邻的两个数中找较大的与上层相加,得出的结果相邻的两个数中再找较大的与上层相加,以此类推。     继续阅读
MXlwq's avatar
MXlwq 4月 09, 2016
 |