hdu 2489 Minimal Ratio Tree 枚举+prim
2012-11-05 21:53
393 查看
/*
可能测试数据有些弱吧,没理解这句话(if there's a tie, look at the second smallest node number),依然过了,大体思路枚举(因为数据小)选的点,就确定节点的和,在用mst就确定最小的边和
*/
#include
#include
#include
using namespace std;
const int maxn=30;
con
可能测试数据有些弱吧,没理解这句话(if there's a tie, look at the second smallest node number),依然过了,大体思路枚举(因为数据小)选的点,就确定节点的和,在用mst就确定最小的边和
*/
#include
#include
#include
using namespace std;
const int maxn=30;
con
相关文章推荐
- HDU 2489 Minimal Ratio Tree (DFS枚举+最小生成树Prim)
- HDU 2489 Minimal Ratio Tree (DFS枚举+最小生成树Prim)
- HDU 2489 Minimal Ratio Tree (DFS枚举+最小生成树Prim)
- HDU 2489 Minimal Ratio Tree(prim+DFS)
- HDU-2489 Minimal Ratio Tree(最小生成树[Prim])
- HDU 2489 Minimal Ratio Tree(枚举组合+最小生成树)
- HDU 2489 Minimal Ratio Tree(dfs+最小生成树-Prim)
- HDU 2489 Minimal Ratio Tree(prim+dfs)
- hdu 2489 Minimal Ratio Tree(枚举+最小生成树)
- hdu 2489 Minimal Ratio Tree(dfs枚举 + 最小生成树)~~~
- hdu 2489 Minimal Ratio Tree dfs枚举组合情况+最小生成树★
- HDU 2489 Minimal Ratio Tree (暴力枚举+最小生成树)
- HDU 2489 Minimal Ratio Tree(dfs+最小生成树-Prim)
- HDU 2489 Minimal Ratio Tree(dfs枚举+最小生成树)
- hdu 2489 Minimal Ratio Tree 枚举+最小生成树
- hdu 2489 Minimal Ratio Tree 最小生成树+枚举
- hdu - 2489 - Minimal Ratio Tree(枚举 + MST)
- hdu 2489 Minimal Ratio Tree(prim+dfs)
- HDU 2489 Minimal Ratio Tree(DFS+prim)
- HDU 2489 Minimal Ratio Tree (dfs+Prim最小生成树)