-
test
某公司收到若干报价，然后报价由低到高进行排序。设最低报价为F,最高报价为G。n=0.2*(G-F)
设A，B，C，D，E五个等距区间并取：
A=[F,F+n） B=[F+n,F+2n) C=[F+2n,F+3n) D=[F+3n,F+4n) E=[F+4n,G)
所有的报价都按各自的大小，分别列入上面五个区间。各自区间内的最小报价为该区间的代表报价。如果某区间内没有报价 则以小于该区间的且与该区间相邻的区间内的最高报价代表该区间报价，如果该区间与与之相邻的较小区间内都没有报价则该区间不参加最后计算。取各区间的代表值， 求出其平均值 做为评标基准报价
(A company received a number of quotations, and quotations from low to high order. Minimum price for the F, the highest offer for the G. n = 0.2* (GF) Let A, B, C, D, E, and five equidistant intervals obtained: A = [F, F+ n) B = [F+ n, F+2 n) C = [F+ 2n, F+3 n) D = [F+3 n, F+4 n) E = [F+4 n, G) All quotes are by their size, five were included in the above range. The minimum offer their own range representative of the range quoted. If a range does not offer less than the range of places and range of adjacent intervals with the highest offer within the offer on behalf of the interval, if the interval and the adjacent smaller range do not offer the range not to participate the final calculation. Take the representative value of each interval, calculate the average price as a benchmark evaluation)
- 2011-11-10 22:44:43下载
- 积分：1
-
新的测试试验
欢迎欢迎欢迎欢迎欢迎欢迎欢迎欢迎欢迎欢迎欢迎欢迎欢迎欢迎欢迎欢迎欢迎；
- 2022-01-25 20:19:54下载
- 积分：1
-
used to achieve stack operation. The program is the stack into the stack and sta...
用链表实现栈的操作.该程序有栈的进栈和出栈操作.很简单.这是本人第一次上传程序源代码,如有什么不足之处还望各位多多海涵.-used to achieve stack operation. The program is the stack into the stack and stack up operation. Very simple. This is the first time I uploaded the source code, if there are any deficiencies Agency also look to a lot Haihan.
- 2022-05-08 05:26:50下载
- 积分：1
-
二叉树
二叉树的简单实现，使用了c语言地方萨芬撒但是(this is important file for put it on the web is aimportant thing dsaf fdsa)
- 2017-06-12 20:38:36下载
- 积分：1
-
leetcode-solution
说明： 算法第四版PDF，包含数据结构，基本算法，Java程序(Algorithm version 4 PDF, including data structure, basic algorithm, Java program)
- 2020-05-28 15:51:11下载
- 积分：1
-
数据结构，栈的应用，表达式求值的源码及实验报告！
数据结构，栈的应用，表达式求值的源码及实验报告！-Data structure, stacks of applications, the source expression is evaluated and experimental report!
- 2023-08-01 13:50:02下载
- 积分：1
-
migong
迷宫算法，1代表可以通过，0代表墙壁，自动找寻路线(Maze algorithm, 1 can pass 0 for the walls, automatically find routes)
- 2011-06-11 17:13:39下载
- 积分：1
-
人力资源管理
这是一个数据库项目，是为任何公司开发的人力资源系统。它维护员工的详细信息、员工的职责和公司的工资管理。
- 2022-03-12 13:36:57下载
- 积分：1
-
1
说明： 求最短路，迪杰斯特拉算法，以格子顶点为点，格子上数字为路径长度(dijkstra to the closest road.)
- 2020-06-17 12:40:02下载
- 积分：1
-
10 - Stacks
the ADT we have come up with is a well known
ADT called a stack, which is defined by our four
operations
- 2017-11-11 12:24:57下载
- 积分：1
