-
mowang-language
魔王语言：输入一串字符，可自动翻译成一串语言。(the program of language)
- 2014-07-12 21:57:27下载
- 积分：1
-
LUZHOUYUE
今天，小 G 已了解到修理厂共有 m 种不同的修理原料，对于第 i 种原料，可以对任意一个石桥的美化度增加 di，当然这也需要花费 hi 的费用。由于发货场的修理原料有限，对于任意一种修理原料，只有一件，也就是说小 G 只能选择购买和不购买，对于第 i 种修理材料能成功修理第 j 个石桥的条件是：当且仅当 hi ≥ pj，di ≥ vj。现在，已知这 n 个石桥修理的最小花费值，最小美化需求度，以及 m 种修理原料的费用，可对石桥增加的美化度值，请你帮助小 G 完成这个修理任务。(Today, Xiao G has learned that there are m different repair materials in the repair shop. For the first material, Di can be added to the beautification of any stone bridge. Of course, it also costs hi. Because of the limited repair materials in the delivery yard, there is only one repair material for any kind of repair material, that is to say, small G can only choose to buy or not to buy. For the first repair material, the condition for successful repair of the jth stone bridge is: if and only if hi is greater than pj, Di is greater than vj. Now, the minimum cost of repairing n stone bridges, the minimum demand for beautification, and the cost of m kinds of repairing materials are known, which can increase the beautification value of stone bridges. Please help Xiao G to complete this repairing task.)
- 2020-12-05 13:29:23下载
- 积分：1
-
targyv_baszd
c 语言算法的实例实现,将数据结构中的重要算法实现(C language algorithm is implemented by example, and the important algorithm in data structure is realized)
- 2018-08-03 11:27:57下载
- 积分：1
-
tc_demo
说明： 这是一个数据结构演示系统，可以演示二叉树、二分查找等数据结构(This is a data structure presentation systems, you can demo binary tree, binary search data structure, etc.)
- 2008-09-19 16:23:26下载
- 积分：1
-
chain
链表的模板类,提供插入删除，遍历器，查找等功能，只有一个头文件，可以包含到你的工程(template implemention of Chain)
- 2013-12-09 11:04:33下载
- 积分：1
-
rhsg
c程序C经典数值算法源码,基本包含了数值分析的所有算法()
- 2018-04-03 21:42:19下载
- 积分：1
-
kuaisupaixu
计算机软件技术基础实验之快速排序程序，实现语言为c(Computer software technology based on quick sort of experimental procedure, the realization of language as c)
- 2008-04-07 18:00:37下载
- 积分：1
-
astar
A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0)
2、重复以下步骤:
在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点
把当前节点从开放列表删除, 加入到封闭列表.
(A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)
- 2013-04-04 11:06:42下载
- 积分：1
-
priority-queue
使用循环队列创建最小和最大优先队列，并使用堆排序方法去排序。(Using the circular queue to create the min and max priority queue, and using heap sort method to sort the queue.)
- 2013-09-21 23:18:49下载
- 积分：1
-
数据结构（c语言）
说明： 数据结构经典教程，对各位编程有帮助！！！(Classic book of data structure, which is helpful to programming)
- 2019-05-29 16:04:29下载
- 积分：1
