- 博客(3)
- 收藏
- 关注
原创 数据结构 归并排序-逆序数对
逆序对是指数列a[1],a[2],a[3]…中的任意两个数a[i],a[j] (ia[j],那么我们就说这两个数构成了一个逆序对。而归并排序的合并两个排列的过程中会将右边的有序序列的元素依次插入前面的 有序序列如(3 7 12) ( 5 6 8)将5 插入 (3 7 12) 中因为后面有序 所以 假设 5和左边全部元素构成逆序对 所以有mid+1
2014-12-28 19:25:46 1118
原创 hdu1247 Hat’s Words 字典树
Problem DescriptionA hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.You are to find all the hat’s words in a dictionary. Inpu
2014-12-24 12:03:26 996
原创 HDU4109 Instrction Arrangement 拓扑排序 关键路径
Problem DescriptionAli has taken the Computer Organization and Architecture course this term. He learned that there may be dependence between instructions, like WAR (write after read), WAW, RAW.If
2014-12-07 15:43:29 1029
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人