Gas StationA gas station has to be built at such a location that the minimum distance between the station and any of the residential housing is as far...
分类：
其他好文 时间：
2015-06-07 14:34:08
阅读次数：
163
A gas station has to be built at such a location that the minimum distance between the station and any of the residential housing is as far away as po...
分类：
其他好文 时间：
2015-03-16 12:51:44
阅读次数：
137
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2426For any school, it is hard to find a feasible accommodation plan with every student assigned to a s...
分类：
编程语言 时间：
2015-03-15 13:37:30
阅读次数：
166
A gas station has to be built at such a location that the minimum distance between the station and any of the residential housing is as far away as po...
分类：
其他好文 时间：
2015-03-01 08:52:30
阅读次数：
186
Polymerstationpostinsulatorisonemainkindofpolymerinsulatorsusedinsubstationandstationwiththeswitchintransmissiontheelectricityprocess.ThefeaturesofPolymerstationpostinsulator1.Conventionaldesignsolidcoreinsulator2.Siliconeshedhousingisinjectionmoldedontoand..
分类：
其他好文 时间：
2015-02-05 07:14:32
阅读次数：
142
HDU 2426 Interesting Housing Problem
题目链接
题意：n个学生，m个房间，给定一些学生想住房的喜欢度，找一个最优方案使得每个学生分配一个房间，并且使得喜欢度最大，注意这题有个坑，就是学生不会住喜欢度为负的房间
思路：很明显的KM最大匹配问题，喜欢度为负直接不连边即可
代码：
#include
#include
#include ...
分类：
其他好文 时间：
2014-10-31 13:50:57
阅读次数：
181
#include #include #include #include #include #define inf 1000001using namespace std;struct node{ int x,y,c,w; int next;} eg[400001];int n,m,K,s,...
分类：
其他好文 时间：
2014-10-11 00:14:04
阅读次数：
242
This paper provides an overview and some conclusions from the HOUSING datasets disposed by the classical algorithms Kmeans and Hierarchical clustering. The total process of the project is divided into five parts including data preprocessing, selecting the ...
分类：
其他好文 时间：
2014-10-03 13:14:24
阅读次数：
141
Interesting Housing Problem
Time Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2388 Accepted Submission(s): 879
Problem Description
...
分类：
其他好文 时间：
2014-07-29 14:57:58
阅读次数：
315
题目链接：http://poj.org/problem?id=1358题意：给出K个n*m的空地，字母A-Z表示障碍。对于每一块，你可以将某一种字母全部拿走，使得出现一个h*w的空地。但是每一种字母在一块中被拿走在另一块中就不允许拿这种字母了。求K块中最多有多少块可以出现多少h*w的空地？思路：（1...
分类：
其他好文 时间：
2014-06-23 07:33:11
阅读次数：
215
