Traveling Salesman Problem 市场上有很多种商品，旅行商 Shrek 做短期买卖赚取差价。他从一个城市购买一件商品，到达下一个相邻的城市就卖掉。如果这一次买卖无利可图，那么他就不会这么走。凭着自己和同伴多年的经验，他已经对地图上 n 个城市之间的差价了如指掌。两城市间可能有多种商品可赚取差价，此时 Shrek 只好倒卖利润最大的一件商品。 现在请你帮 Shrek 规划一条路线，使他能赚最多的钱。 输入 第一行两个整数 n、m。表示有 n 个城市，编号 1 ~ n 接下来有 m 行，每行三个整数 a、b、price，表示从城市 a 到城市 b 可赚取差价 price。 输出 若干空格分隔的整数，连成一条赚钱最多的路线。若有多条，输出字典序最小的那条路线（编号小的城市靠前的路线优先输出） 输入样例 4 4 2 1 5 1 3 3 3 4 1 1 4 5 输出样例 2 1 4(Traveling Salesman Problem)
说明： Traveling Salesman Problem 市场上有很多种商品，旅行商 Shrek 做短期买卖赚取差价。他从一个城市购买一件商品，到达下一个相邻的城市就卖掉。如果这一次买卖无利可图，那么他就不会这么走。凭着自己和同伴多年的经验，他已经对地图上 n 个城市之间的差价了如指掌。两城市间可能有多种商品可赚取差价，此时 Shrek 只好倒卖利润最大的一件商品。 现在请你帮 Shrek 规划一条路线，使他能赚最多的钱。 输入 第一行两个整数 n、m。表示有 n 个城市，编号 1 ~ n 接下来有 m 行，每行三个整数 a、b、price，表示从城市 a 到城市 b 可赚取差价 price。 输出 若干空格分隔的整数，连成一条赚钱最多的路线。若有多条，输出字典序最小的那条路线（编号小的城市靠前的路线优先输出） 输入样例 4 4 2 1 5 1 3 3 3 4 1 1 4 5 输出样例 2 1 4(Traveling Salesman Problem)
今天，小 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.)
说明： 今天，小 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语言实现 1、大数阶乘 2、大数乘法 3、任意进制转换 4、最大公约数 5、最小公倍数 6、快速傅里叶变换 7，字符串的替换，查找，截取 8、叉乘法求多边形的面积 9、快速，希尔，选择等各种排序 10、二叉树，链表，链栈 11、二分查找 12、求解线性方程组，也叫中国余数定理 13、求点到直线距离 14、Prim算法求最小生成器 15、判断点与直线的关系，俩条直线的关系 16、求排列组合数，俩矢量角度 ...... 等等基础算法的C语言代码实现(1, large factorial 2, a large number of multiplication 3, arbitrary binary conversion 4, the largest common divisor 5, the least common multiple 6, fast Fourier transform 7, string replacement, search, interception 8, fork multiplication method for polygon area 9, fast, Hill, choice and other sort 10, binary tree, linked list, chain stack 11, binary search 12, solving linear equations, also known as the Chinese remainder theorem 13, seeking point to a straight line distance 14, Prim algorithm for the minimum generator 15, determine the point and the relationship between the two lines of the relationship 16, the number of permutations and combinations, two vector angle ... And so on the basis of the C language code algorithm)
计算点到直线的距离．输入两点坐标确定一个直线，再输入一个点的坐标，计算该点到直线的距离．(Calculated point to the straight line distance. Enter the coordinates of two points determine a straight line, and then input the coordinates of a point, to calculate the straight-line distance between points.)
设计、编写和调试面向对象C++程序，实现任意两个同类数据比大小 的通用函数（模板），涵盖普通数值型数据之间的比较、两个字符串之间的比较 （按字典序）、两个复数之间的比较（按模大小）等，并通过主函数加以调用和 测试。(Design, writing and debugging of object-oriented C++ procedures to achieve similar data than the size of any two generic functions (template), covering general comparison between numerical data, the comparison between the two strings (lexicographically), two Comparison between complex numbers (modulo the size), and through the main function to be invoked and tested.)
利用极小极大算法实现简单的零和博弈；利用递归算法实现博弈树搜索的方法，并解决牛角棋问题。(Using minimal algorithm to achieve a simple zero-sum game the use of recursive algorithm to achieve the game tree search method, and solve the horns chess problem.)
北京理工大学信息与电子学院数据结构课程实验代码(Experimental code of data structure course of information and Electronics College of Beijing Institute of Technology)
说明： 可以实现图书管理系统，并且实现哈德曼夫二叉树，以及数列(Can realize the library management system)
纯C语言编程的模拟现有图书馆的借阅、续借、归还；图书入库、出库；查询、排序等功能，实现电子图书馆的智慧综合管理。其中查询功能里面嵌套精确查询，排序功能有六种，界面可变色，里面已经附带50多本图书信息包括图书摘要等详细信息。里面还附带详细设计报告和解说PPt。(Pure C language programming simulation existing library borrow, renew, return book storage, a library queries, sorting and other functions, to achieve integrated management of electronic library wisdom. Precisely where the query function inside a nested query, sort function has six, the interface can change color, which has included more than 50 books including books summary information and other details. Which also included detailed design reports and commentary PPt.)
纯C语言编程的模拟现有图书馆的借阅、续借、归还；图书入库、出库；查询、排序等功能，实现电子图书馆的智慧综合管理。其中查询功能里面嵌套精确查询，排序功能有六种，界面可变色，里面已经附带50多本图书信息包括图书摘要等详细信息。里面还附带详细设计报告和解说PPt。(Pure C language programming simulation existing library borrow, renew, return book storage, a library queries, sorting and other functions, to achieve integrated management of electronic library wisdom. Precisely where the query function inside a nested query, sort function has six, the interface can change color, which has included more than 50 books including books summary information and other details. Which also included detailed design reports and commentary PPt.)
大二时做的一个数据结构的课程设计，用2-3树实现的图书馆管理系统，只是控制台程序，没有很好的图形界面。包括管理员、读者。管理员功能有：采编入库、查看图书、查看读者、删除读者。读者功能有：借书、还书、预约、查找等等。。功能全面。包括注册账号，登录需要账号密码。(Sophomore to do a data structure of the curriculum design, with 2-3 tree implementation of library management system, but the console program, not a good graphical interface. Including administrators, readers. Administrator functions include: editing storage, check books, check readers, delete readers. Reader functions: library, book, booking, search and so on. . Full-featured. Including the registration account, login account password required. )
基于数据结构的图书管理系统，基本功能都有，可以拿来作为数据结构的课程设计(Based library management system data structures, basic function, can be used as a data structure of the curriculum design)
C++英文版 数据结构与算法分析选择题题库(Choice of data structures and algorithm analysis exam)
B-树的创建、插入、删除等一系列操作！(B-tree creation, insert, delete a series of manipulations!)
用控制台实现了经典的数据结构B树，可以通过测试文件.txt加载已有的B树，有插入，删除，查找的功能，加深对数据结构的理解。(Using the console to achieve the classic B tree data structure, you can pass the test document. Txt already loaded B-tree, there are insert, delete, search functions, to deepen understanding of the data structure.)
中科大数据结构全部上机实验的实验程序以及报告，内容包括多项式，图，栈，SQL语言……(All experimental procedures USTC data structures as well as reports on experiments, including polynomial, maps, stack, SQL language ......)
中科大数据结构全部上机实验的实验程序以及报告，内容包括多项式，图，栈，SQL语言……(All experimental procedures USTC data structures as well as reports on experiments, including polynomial, maps, stack, SQL language ......)
本站资源：696518 个
本站会员：104287 个
总计下载：494206 次
今日上传：0 个
Copyright© 2019-2024 |
Powered by Imdn
|
浙ICP备16007336号
|
|
联系客服（QQ：3324461878）
本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！
