login oracle

在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的两堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分，并分析算法的计算复杂度。-in a circle around the playground are placed n gravel pile. Is a stone should order to be merged into a heap. Stipulated that only elected adjacent to the pile of gravel into the new heap, and a new pile of gravel credited for the combined scores. Design a test algorithm to calculate n heap into a pile of gravel to the minimum score and the biggest score and analysis of algorithm complexity.

精品专家讲述C语言附大量经典实例超值!!!!! ____________^-^___________^-^___________ 程序员必学-quality experts about C language with a large number of classic examples of excellent !!!!! ____________^-^___________^-^______ _____ programmers must learn!

这是经典迷宫问题，本代码是用C语言实现的-This is the classic maze problem, the code is achieved using C language

二叉树的一些基本实现：具备功能：创建、删除二叉树（包括文件读取录入信息），先中后根显示二叉树（递归算法），结点信息查询（包括：结点所在层数，结点孩子个数，结点在先中后根排序中的位置、寻到结点路径长度），二叉树相似度比较；附带注释，界面友好，代码是在VC6.0下写的。

从ACCESS文件中提取DBF文件,可以将ACCESS文件中提取DBF文件,并建立一个数据库文件,包括ACCESS文件中的所有表.-ACCESS documents from the DBF file extraction can be extracted ACCESS DBF file documents, and the establishment of a database file, including documents, the ACCESS all the tables.

oledb的例子，在pda上好用-connectivity example, pda on Easy

数据库远代码，比较好的java实现的，比较清晰好用-The database is far code, java to achieve a better, more clear and easy to use

连接oracle的java库- Connects oracle the java storehouse

算法设计的动态规划中的最优二叉搜索树问题，是用VC＋＋编写的-algorithm design of dynamic optimal planning of two forks search tree problem by using VC++ prepared

判别算得到 定界符 所进肺腑 军费发 费用打击法打击法 夫君诶非 夫君诶发-discriminant obtained delimiters are made into the heart of military combat costs combat goes wherever eh eh-fat