Minimal Ratio Tree

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

【Problem Description】
For a tree, which nodes and edges are all weighted, the ratio of it is calculated according to the following equation.Given a complete graph of n nodes with all nodes and edges weighted, your task is to find a tree, which is a sub-graph of the original graph, with m nodes and whose ratio is the smallest among all the trees of m nodes in the graph.
【Input】
Input contains multiple test cases. The first line of each test case contains two integers n (2<=n<=15) and m (2<=m<=n), which stands for the number of nodes in the graph and the number of nodes in the minimal ratio tree. Two zeros end the input. The next line contains n numbers which stand for the weight of each node. The following n lines contain a diagonally symmetrical n×n connectivity matrix with each element shows the weight of the edge connecting one node with another. Of course, the diagonal will be all 0, since there is no edge connecting a node with itself.
All the weights of both nodes and edges (except for the ones on the diagonal of the matrix) are integers and in the range of [1, 100].
The figure below illustrates the first test case in sample input. Node 1 and Node 3 form the minimal ratio tree.
 
【Output】
For each test case output one line contains a sequence of the m nodes which constructs the minimal ratio tree. Nodes should be arranged in ascending order. If there are several such sequences, pick the one which has the smallest node number; if there's a tie, look at the second smallest node number, etc. Please note that the nodes are numbered from 1 .
【Sample Input】

【Sample Output】

 

【题意】

给出一张n个点的图,图中的每一个结点以及每一条边都有其权值,要求从中选出m个点,找到m-1条边将其连接,使得边权值与点权值的比值达到最小。

【分析】

要使得比值最小,则点权值和尽可能地大同时边权值和尽可能地小。直接上考虑,边权值和尽可能小即对这m个点作最小生成树。

而题目给定的n不大,故可以用DFS搜出需要的m个点,然后对m个点进行最小生成树,中间注意判断和保存即可。

我用了一个dijkstra+优先队列的prim去找MST,这也是我第一次尝试使用STL的优先队列。

 #include<iostream>
#include<cstdio>
#include<cstring>
#include<queue> using namespace std; bool flag[],outp[];
int n,m,node[];
int ma[][];
double mi; typedef struct heaptyp
{
int num,key;
friend bool operator < (heaptyp a,heaptyp b)
{
return a.num>b.num;
}
} heaptype; void prim(int s,int tot)
{
int i,j,now,ans;
bool fla[];
priority_queue<heaptype>heap;
heaptype aaa; memset(fla,,sizeof(fla));
fla[s]=true;
ans=;
for (i=;i<=n;i++)
if (flag[i]&&ma[s][i])
{
heaptype temp;
temp.num=ma[s][i];
temp.key=i;
heap.push(temp);
aaa=heap.top();
} for (j=;j<m;j++)
{
heaptype h=heap.top();
heap.pop();
aaa=heap.top();
while (fla[h.key])
{
h=heap.top();
heap.pop();
}
now=h.key;
fla[now]=true;
ans+=h.num;
for (i=;i<=n;i++)
if (flag[i]&&ma[now][i])
if (!fla[i])
{
heaptype temp;
temp.num=ma[now][i];
temp.key=i;
heap.push(temp);
aaa=heap.top();
}
}
double rat=(double)ans/tot;
if (mi-rat>0.0000001)
{
mi=rat;
for (int i=;i<=n;i++) outp[i]=fla[i];
}
} void dfs(int now,int last,int tot)
{
if (now==m)
{
int i;
for (i=;i<=n;i++)
if (flag[i]) break;
prim(i,tot);
}
else
{
now++;
for (int i=last+;i<=n-m+now;i++)
{
flag[i]=true;
dfs(now,i,tot+node[i]);
flag[i]=false;
}
}
} int main()
{
scanf("%d%d",&n,&m);
while (!(n==&&m==))
{
for (int i=;i<=n;i++) scanf("%d",&node[i]);
for (int i=;i<=n;i++)
for (int j=;j<=n;j++) scanf("%d",&ma[i][j]); mi=;
memset(flag,,sizeof(flag));
for (int i=;i<=n-m+;i++)
{
flag[i]=true;
dfs(,i,node[i]);
flag[i]=false;
} int i;
for (i=;i<=n;i++)
if (outp[i])
{
printf("%d",i);
break;
}
for (int j=i+;j<=n;j++)
if (outp[j]) printf(" %d",j);
printf("\n");
scanf("%d%d",&n,&m);
} return ;
}

HDU 2489 Minimal Ratio Tree 最小生成树+DFS的更多相关文章

  1. HDU 2489 Minimal Ratio Tree (dfs+Prim最小生成树)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2489 Problem Description For a tree, which nodes and ...

  2. HDU 2489 Minimal Ratio Tree (DFS枚举+最小生成树Prim)

    Minimal Ratio Tree Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) ...

  3. HDU 2489 Minimal Ratio Tree(暴力+最小生成树)(2008 Asia Regional Beijing)

    Description For a tree, which nodes and edges are all weighted, the ratio of it is calculated accord ...

  4. HDU 2489 Minimal Ratio Tree(prim+DFS)

    Minimal Ratio Tree Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Other ...

  5. HDU 2489 Minimal Ratio Tree(dfs枚举+最小生成树)

    想到枚举m个点,然后求最小生成树,ratio即为最小生成树的边权/总的点权.但是怎么枚举这m个点,实在不会.网上查了一下大牛们的解法,用dfs枚举,没想到dfs还有这么个作用. 参考链接:http:/ ...

  6. hdu 2489 Minimal Ratio Tree

    http://acm.hdu.edu.cn/showproblem.php?pid=2489 这道题就是n个点中选择m个点形成一个生成树使得生成树的ratio最小.暴力枚举+最小生成树. #inclu ...

  7. HDU2489 Minimal Ratio Tree 【DFS】+【最小生成树Prim】

    Minimal Ratio Tree Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Other ...

  8. {POJ}{3925}{Minimal Ratio Tree}{最小生成树}

    题意:给定完全无向图,求其中m个子节点,要求Sum(edge)/Sum(node)最小. 思路:由于N很小,枚举所有可能的子节点可能情况,然后求MST,memset()在POJ G++里面需要cstr ...

  9. Minimal Ratio Tree HDU - 2489

    Minimal Ratio Tree HDU - 2489 暴力枚举点,然后跑最小生成树得到这些点时的最小边权之和. 由于枚举的时候本来就是按照字典序的,不需要额外判. 错误原因:要求输出的结尾不能有 ...

随机推荐

  1. linux4.1.6+aufs4.1

    http://aufs.sourceforge.net/ linux kernel version aufs version 4.0 and later aufs4 Currently aufs4 s ...

  2. 使用HAXM加速Android虚拟机

    Android虚拟机在支持Intel VT技术的CPU上,可以使用HAXM(Hardware Accelerated Execution Manager)得到硬件加速支持,使得虚拟机运行速度得到极大提 ...

  3. Bookmark

    http://stackoverflow.com/https://www.baidu.com/?tn=06074089_27_pghttp://apistore.baidu.com/http://to ...

  4. 收缩sql server数据库日志

    项目中,可能数据库(sql server数据库)日志太多,占了很多磁盘空间,可以通过收缩数据库日志,减少日志文件大小. 下面以Northwind数据库为例: 1.把数据库的恢复模式设置为“简单模式”: ...

  5. 【bfs】 poj 3984 maze 队列存储

    #include <iostream> #include <stdio.h> #include <cstring> #define Max 0x7f7f7f7f u ...

  6. icon在页面中的使用

    https://icomoon.io/app/#/select 1.上传.svg新图标 2.选中那个小图标,点底部导航的生成字体. 3.然后命名,下载. 4.下载下来的内容只有这两处是必须要用的. 5 ...

  7. POJ 1182 食物链 经典并查集+关系向量简单介绍

    题目: 动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形.A吃B, B吃C,C吃A. 现有N个动物,以1-N编号.每个动物都是A,B,C中的一种,但是我们并不知道它到底是哪一种. 有 ...

  8. linux的学习系列 3---目录

    目录也是一个文件,它的唯一功能是用来保存文件及其相关信息.所有的文件,包括普通文件.设备文件和目录文件,都会被保存到目录中. 主目录 登录后,你所在的位置就是你的主目录(或登录目录),接下来你主要是在 ...

  9. Python实现删除目录下相同文件

    让我们来分析一下这个问题:首先,文件个数非常多,手工查找是不现实的,再说,单凭我们肉眼,在几千张图片或文件里面找到完全相同的难度也是很大的.所以要用程序实现.那么用程序怎么实现呢?根据什么判断两个文件 ...

  10. Android平台设计规范整理(尺寸+组成元素+字体+滑块)

    转自:http://www.ui.cn/project.php?id=12394