求出一个序列的最长升序列,使用了动态规划的方法

伙伴系统:avail[0..m]为可利用空间表, n为申请分配量, 若有不小于n的空闲块, 则分配相应的存储块, 并返回其首地址,否则返回NULL -Partner system: avail [0 .. m] can be used for table space, n for the distribution of the volume of applications, if n is not less than the free block, then the distribution of the corresponding storage block, and return to its first address, otherwise return NULL

pku acm上的3083源代码，不过没有解题报告-pku acm on the 3083 source code, but I did not report Problem Solving

日本ATR（Advanced Telecommunication Research InstituteInternational）的专门用于表情识别研究的基本表情数据库JAFFE，该数据库中包含了213幅（每幅图像的分辨率：256像素×256像素）日本女性的脸相，每幅图像都有原始的表情定义。表情库中共有10个人，每个人有7种表情（中性脸、高兴、悲伤、惊奇、愤怒、厌恶、恐惧）。 JAFFE数据库均为正面脸相，且把原始图像进行重新调整和修剪，使得眼睛在数据库图像中的位置大致相同，脸部尺寸基本一致，光照均为正面光源，但光照强度有差异。由于此表情数据库完全开放，且表情标定很标准，所以现在大多数研究表情识别的文章中都使用它来训练与测试。-Japan ATR (Advanced Telecommunication Research InstituteInternational), devoted to the basic expression of facial expression recognition research database JAFFE, the database contains 213 (each image resolution: 256 pixels × 256 pixels) Japanese women face relative to each piece of expression of both the original definition of the image. Expression library, a total of 10 individuals, each person has seven kinds of expressions (neutral face, happy, sad, surprise, anger, disgust, fear). JAFFE face database are positive phase, and the original image is re-adjust and trim, making the eye the location of the image in the database similar to the face basically the same size, ligh

2.1将n个人围成一圈，m为未进入游戏前的先行码，用来淘汰第一个出 局的人，然后依次给出淘汰者的密码，根据输入的密码来确定下一个淘汰是哪一个，并依次输出被淘汰的人对应的号码。 2.2用单向循环链表实现操作。-2.1 n personal cordons m not yet entered the game before the first yards out for the first out, then eliminated were given the password, the password to determine under which a one-out, and turn out the output of the corresponding number. 2.2 List circle with a one-way operation to achieve.

高级算法里的排序讲义ppt。sorting- In high-level algorithm arrangement printed lecture ppt. Sorting

用JAVA开发的数据库底层核心，是学习用JAVA开发数据库系统的必要资料。-with JAVA development of the database underlying core, Java is used to study the development of a database system the necessary information.

最短路径方法The shortest path method-The shortest path method

我们数据结构课上的一些作业 包括约瑟夫环和哈夫曼树之类的几个程序-Our data structure class operations, including some of Joseph Huffman tree rings and several procedures, such as

我自己写的数值分析课程设计的算法，这里是数值拟合的部分。-I wrote it myself numerical analysis courses designed algorithm, which is part of the numerical fitting.

严蔚敏经典教材《数据结构》的算法源码和实验演示系统-Data Structure