adapt the DP to solve the common longest strings(two and one dimension array)

磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn-document optimal disk storage, disk based on documents n f1, f1, fn. each file on disk for a cylinder. N This document retrieval probability were p1, p2, and pn

一个很好的VC＋＋　用ODBC编的-a good VC++ using ODBC series

堆栈表达式求值系统,处理整型数，c语言编写-stack expression for the value system, handling integer, c language

各种数据库语法，如 Oracle、DB2、Informix、MySql、Postgre-Syntax of various databases such as Oracle, DB2, Informix, MySql, Postgre

ADO&VC&SQL的例子，很经典-ADO

建立带表头结点的单链表，打印所有结点的数据域；输入一个值，若某个结点的数据域为该值，则在其后插入另一个新结点，若无此结点，则在表尾插入新结点，然后打印；给一个值，删除结点的数据域是该值的所有结点，然后打印。（表生成时可用前插法或后插法）-table with the establishment of the first node of a single linked list, print all nodes of the data domain; An input value, If a node"s data fields for the values, and subsequently inserted in a new node, in the absence of such nodes, at the end of the insertion of a new form nodes, then Print; to a value of the node to delete data domain is the value of all the nodes, then Print. (Table Generation available houses or after interpolation)

INFORMIX数据库优化SHELL，可以一目了然地发现数据库中的性能问题。-shell form informix ,can find question of databases

vc编写的小型旅馆管理系统-vc prepared by the small hotel management system

定义一个栈，并实现栈的基本操作： void Push( const T& x) // bool Pop(T& x) // bool getTop(T& x) const // ostream& operater