Location:
Search - post office
Search list
Description: 一个实现POP3邮局协议的例程，使用VC编写，在VC6下编译运行通过。-achieve an agreement POP3 post office routines, the use of VC prepared under the VC6 running through the compiler.
Platform: |
Size: 154857 |
Author: name |
Hits:
Description: 这个是大家非常熟悉的一个非常常用的算法,邮局选择问题,相信大家一定可以学到很多东西的-This is all very familiar with a very commonly used algorithm, the post office matter of choice, I am sure that you can learn a lot of things
Platform: |
Size: 7322 |
Author: 周华 |
Hits:
Description: 这是一个邮局选址问题，计算中心距离最小，希望对大家有帮助-This is a post office site, the minimum distance ICC, we hope to help
Platform: |
Size: 1050 |
Author: 郑文清 |
Hits:
Description: 经典算法实现题--邮局选址问题，包括题目PDF和程序代码实现，与大家分享。-classical algorithm that -- post office location, including the subject PDF and procedures to achieve code share with you.
Platform: |
Size: 543613 |
Author: 林总 |
Hits:
Description: 差不多2W行代码，一行行的看完，嘿嘿，疲劳下，出现了不少问题。
不过近期是没有精力修正了^__^
所以对准备使用此邮局系统的朋友提出以下建议：
1.将本汉化版本作为您研究的参照，应该能为您省好大力气（推荐选项）
2.使用本版本，其中由于我的失误，确实出现了一些问题，不过基本的
邮局操作，还是差不多的，hoho
3.继续关注，年底时间空闲下来，我肯定会从新梳理一下过程，修改错误:)
请美工好的朋友有时间来为这个邮局系统修改或制作一下模板哦，hoho
希望大家都能有自己的企业邮局 :) ^____^-almost 2W lines of code, lines read a little, fatigue, a lot of problems have emerged. But no effort is the recent amendment to the ^ __ ^ so ready to use this system offices friends made the following recommendations : 1. The finished version will be as the light of your research, You should be able to great efforts Province (recommended option) 2. Use of this version, as my mistakes, Indeed there have been some problems, but the basic operation of the post office, or roughly the same, hoho 3. continued concern, from the end of idle time, I am sure I will sort out what the new process to amend the mistakes : ) Please graphic good friends have time for the post office system changes or the production of this template Oh, hoho hope that everyone can have their own business offices :) ^____^
Platform: |
Size: 6846546 |
Author: kaixin |
Hits:
Description: 这是一个关于post office的问题,代码不多,但是独到.-This is a post office on the issue, code small, but unique.
Platform: |
Size: 792 |
Author: 浪风 |
Hits:
Description: 编程计算n个居民点到邮局的距离总和的最小值。
-programming calculating n settlements to the post office the sum of the minimum distance.
Platform: |
Size: 76648 |
Author: 张丽兰 |
Hits:
Description: 一个支持POP3(Post Office Protocol Version 3)的MFC类-a support POP3 (Post Office Protocol Version 3), the MFC category
Platform: |
Size: 18832 |
Author: 大海 |
Hits:
Description: 根据POP3（Post Office Protocol 3）POP适用于C/S结构的脱机模型的电子邮件协议，实现从邮件服务器下载电子邮件等功能。
Platform: |
Size: 11564 |
Author: dongfangyun |
Hits:
Description: 算法分析ACM题目：邮局选址算法
保证能运行！算法分析课程必备！-Algorithm Analysis ACM topics: post office site selection algorithm guaranteed to run! Algorithm analysis courses required!
Platform: |
Size: 144384 |
Author: 黄子聪 |
Hits:
Description: 在一个按照东西和南北方向划分成规整街区的城市里，n 个居民点散乱地分布在不同的街区中。用x 坐标表示东西向，用y 坐标表示南北向。各居民点的位置可以由坐标(x,y)表示。街区中任意2 点(x1, y1) 和(x2, y2) 之间的距离可以用数值| x1 . x2| + | y1 . y2| 度量。
居民们希望在城市中选择建立邮局的最佳位置，使n 个居民点到邮局的距离总和最小。-In a direction in accordance with the East-West and North-South divided into regular city blocks, n and the distribution of settlements scattered in different neighborhoods in. Things used to express the coordinates x, y coordinates used to express the North and the South. The location of the settlements by the coordinates (x, y) express. Arbitrary blocks 2:00 (x1, y1) and (x2, y2) can use the distance between the values | x1. X2 |+ | Y1. Y2 | metrics. Residents want the city to select the best location to establish post offices, so that n settlements to the post office the sum of the smallest distance.
Platform: |
Size: 1024 |
Author: 程光 |
Hits:
Description: 克拉玛依市邮政局门户网站，是通过C#语言在 .NET环境下开发的。-Karamay City Post Office portal, through the C# Language. NET development environment.
Platform: |
Size: 1542144 |
Author: 努尔兰 |
Hits:
Description: 著名图论问题之一。邮递员从邮局出发送信，要求对辖区内每条街，都至少通过一次，再回邮局。在此条件下，怎样选择一条最短路线?此问题由中国数学家管梅谷于1960年首先研究并给出算法，故名。-Well-known graph theory problems. Postman deliver a letter from the post office proceed to require every street within the right area, at least through the time, return to post office. Under these conditions, how to select a shortest route? This issue by the Chinese mathematician Mei Gu tube study in 1960, and gives the first algorithm, hence the name.
Platform: |
Size: 358400 |
Author: lsd |
Hits:
Description: this a project on dot net name e post office very use full for postal service-this is a project on dot net name e post office very use full for postal service
Platform: |
Size: 15557632 |
Author: kishore |
Hits:
Description: post office 邮局选址问题 分治算法，能运行，我已经调好的-post office post office location problem Divide and Conquer Algorithm, can run, I have a good tune
Platform: |
Size: 2048 |
Author: crp0289 |
Hits:
Description: This post office based project in java-This is post office based project in java
Platform: |
Size: 223232 |
Author: KP Thakur |
Hits:
Description: 这是一个邮局选址问题。给定n 个居民点的位置,编程计算n 个居民点到邮局的距离总和的最小值。上传文件包括可执行文件、源代码和六组测试用例。-This is a post office location problem. N settlements given location, programming calculation of n settlements to the sum of the minimum distance from the post office. Upload files, including executable files, source code, and six groups of test cases.
Platform: |
Size: 143360 |
Author: 汪金 |
Hits:
Description: 算法设计与分析中邮局选址问题。
select(int[] array, int begin, int end, int middle)将n个输入元素划分成n/5个组，每组5个
元素，只可能有一个组不是5个元素。用任意一种排序算法，将每组中的元素排好序，并取出每组的中
位数，共n/5个。找出这n/5个元素的中位数。如果n/5是偶数，就找它的2个中位数中较大的一个。
以这个元素作为划分基准。在调用时，只需要将middle参数传入array.length/2就能找到整个数组中的
中位数。然后调用两次computeDistance(int[] array)方法，分别求出各中位数到各个居民点的横坐标
和纵坐标的距离，将两距离相加即为该问题的最优解，最后将结果存入输出文件中。-Algorithm design and analysis problems in the post office location. select (int [] array, int begin, int end, int middle) n input elements will be divided into n/5 groups, 5 elements in each group, there may be only one group is not five elements. With any of the sorting algorithm, the elements of each group sorted and remove the median for each group of n/5 个. Median identify these n/5 elements. If n/5 is an even number, to find the median of its two larger one. With this element as the division benchmarks. When you call, simply middle parameter passed array.length/2 can be found in the median of the entire array. Then called twice computeDistance (int [] array) method, the median distance were calculated for each individual settlements to the horizontal and vertical coordinates, the distance will be the sum of the two is the optimal solution to this problem, the final results into the output file.
Platform: |
Size: 168960 |
Author: |
Hits:
Description: poj1160
There is a straight highway with villages alongside the highway. The highway is represented as an integer axis, and the position of each village is identified with a single integer coordinate. There are no two villages in the same position. The distance between two positions is the absolute value of the difference of their integer coordinates.
Post offices will be built in some, but not necessarily all of the villages. A village and the post office in it have the same position. For building the post offices, their positions should be chosen so that the total sum of all distances between each village and its nearest post office is minimum.
You are to write a program which, given the positions of the villages and the number of post offices, computes the least possible sum of all distances between each village and its nearest post office. -There is a straight highway with villages alongside the highway. The highway is represented as an integer axis, and the position of each village is identified with a single integer coordinate. There are no two villages in the same position. The distance between two positions is the absolute value of the difference of their integer coordinates.
Post offices will be built in some, but not necessarily all of the villages. A village and the post office in it have the same position. For building the post offices, their positions should be chosen so that the total sum of all distances between each village and its nearest post office is minimum.
You are to write a program which, given the positions of the villages and the number of post offices, computes the least possible sum of all distances between each village and its nearest post office.
Platform: |
Size: 526336 |
Author: cam |
Hits:
Description: E Post office with source code
Platform: |
Size: 5285888 |
Author: jeremiahsan |
Hits: