Flex help documentation in English, it is useful, there are many examples of pro...

用动态规划实现查找两个数列之间的最长公共子序列-Realization of dynamic programming to find the number of columns between the two longest common subsequence

这是一个对Zlib压缩库进行打包COM接口，完整的应用程序和可重用代码-this is a Zlib compression library packaged COM interface, complete applications and reusable code

Driver and Sources for Marvell SD8686 Chip under Linux v9.70.3.p24-Driver and Sources for Marvell SD8686 Chip under Windows XP embedded

一个可以跟踪鼠标位置的程序。。你可以从屏幕任何地方读出现在鼠标的坐标-A mouse can track the location of the procedure. . You can read from the screen anywhere in the mouse coordinates

C# WinForm结合.NET完成国家电网车辆派车系统， 实现车辆管理的普通功能，车辆派车（该系统的主要功能），全程流程短信通知及短信审核，实现对移动车务通GPS接口，完全监控车辆动态 希望对大家有帮助哟!

PC汇编资料大全 -PC Series PC compilation of the data compiled information Daquan

ghhjhhjjdhh fjhhhhhhhhhhhhhhhhhhhhhh hhhhhhhhhhhhhh hhhhhhhhhhhhh hhhhhhhhhhhhhhh hhhhhhhhhhhhhhhhh hhhhhhhhhhhh hjhhfffffffffff  ffffffffffffffffffh fjfjj fjfjfjfg dfhgdgdgdgd dfg dgd dgdgzg  gsg iuh sifuh iuyio yoiuy iuuyfuyhjk uyt uy jhg ut juhiuy uytuhku ytu iyt uy6tuyhiku nu i iuyi uyiuy iu yoi iu uyt uy iuyioyoiuyuiyy ouytiu uytuiy iuyt iuyt

一个仪表盘的例子，超漂亮，可以看看，用vc开发的-Example of a dashboard, super beautiful, you can see, using vc development 

很好用的窗口查看工具 让你能更加方便的查看窗口信息-A good window view with the tool so that you can more easily see the information window

动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(ij)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic programming matrix continually multiply-dynamic programming problem is a problem-solving method. It does not require the results need to be how to divide the problems of the sub- problems fixed, but different input given by the specific example of the problem partition method, and then calculate, and answer questions. Matrix continually multiply the main idea is as follows : 1) the installation of the size of continually multiply the number phalanx 2) above the main diagonal elements Di, j (ilt; J) Matrix Mi continually multiply to the smallest workload 3) below elements Di, j (IGT; J) the record was the smallest workload of a matrix of the first group of a matrix of the final sequence, followed by the final element of the final results of the