摘要：
题意:给出一个无向图,求出图中每个环中最大的边,并按顺序输出,若没有,输出forest;分析:根据kruscal的性质可知,当A点的祖先等于B点的祖先时，说明AB两点构成一个环,并且AB之间的边最大．// File Name: 11747.cpp// Author: Zlbing// Created Time: 2013/4/19 22:44:46#include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include& 阅读全文
摘要：
简单题,因为是生成树,所以A到B只有唯一路径，故只要dfs,找A到B的唯一的那条路// File Name: 10938.cpp// Author: Zlbing// Created Time: 2013/4/19 14:57:26#include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<vector>#include 阅读全文
摘要：
题意:有N个点,E条边,起点S,终点T,每条边都有一个距离值D,和温度值R,问你从S到T的最大温度值最小的情况下距离最短.分析:二分温度值,然后dijkstra求S到T的最短距离// File Name: 10816.cpp// Author: zlbing// Created Time: 2013/2/18 0:27:01#include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#i 阅读全文