fireworks99
keep hungry keep foolish
SPOJ Highways and Find the Determinant lll(Count the spanning trees)
Description of Highways
给出原图(无向图)，求裸的生成树计数
Description of Find the Determinant III
Read more -->求方阵A的行列式的值模P的值
UVA 10766 Organising the Organisation(Count spanning tree)
Description
Read more -->给出N个点的无向图的补图，求原图最小生成树的数目
HDU 4009 Transfer water(Minimun tree-shape graph)
Description
Read more -->N个房子搬到山上，要解决供水问题有两种方案：
①自己打井，耗钱 (X * 房子高度)
②从别家引水，耗钱 (Y * 两房子的曼哈顿距离)，如果源较低，再加一个水泵钱Z
求解决所有房子供水问题的最小花费
HDU 2121 Ice-cream's world II(Minimum tree-shape graph)
Description
Read more -->N个点(0~N-1)M条有向边，不定根(任意一点可选做根节点)求最小树形图
POJ 3164 Command Network(Minimum tree-shape graph)
Description
Read more -->N个点M条有向边，求以1位根节点最小树形图(有向最小生成树)
UVA 10600 ACM Contest and Blackout(Second MST)
Description
Read more -->N个点M条边，求最小生成树与次小生成树
（求生成树，说明边是无向边）
Site by Baole Zhao |
Powered by Hexo |
theme PreciousJoy