threads

今天，小 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.)

本代码是通过C语言来实现贪心算法求着色问题,包括具体问题和实现代码(This code is the C language to implement the greedy algorithm for the coloring problem, including specific issues and the implementation code)

.h文件。c++中的复数类，能够直接完成基本四则运算，输入输出流，完成一定范围内的比较运算(. H file. c++ classes in the plural, to directly perform basic arithmetic, input and output streams, to complete a range of comparison operators)

使用两个栈实现队列的操作，有进站出站等操作(Queue With Two Stacks)

有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

数学建模经典算法，是一系列解决问题的清晰指令，算法代表着用系统的方法描述解决问题的策略机制。也就是说，能够对一定规范的输入，在有限时间内获得所要求的输出。是一系列解决问题的清晰指令，算法代表着用系统的方法描述解决问题的策略机制。也就是说，能够对一定规范的输入 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

说明：  二叉树的演示程序。实现了二叉树和哈弗曼树(Binary tree demo program. Implements a binary tree and the tree Hafu Man)

说明：  《妙趣横生的算法》第三部分原书附带代码程序，绝对属实(&quot Algorithm for fun,&quot the third part of the original program with the code, the absolute truth)

说明：  约瑟夫问题，四种解法，分别是静态链表，顺序表两种和循环链表(Joseph problems, the four solution, namely a static list, order form and the cycle of two lists)

　广度优先搜索及深度优先搜索，用C语言实现，比较使用(Breadth-first search and depth first search, using C language, compared with)