斯文~

https://vjudge.net/problem/HDU-1704分析刚开始居然想用并查集来做????对于2 13 1这个实例，2和3是没关系的，但是用并查集反而有了关系因此不能双向存图，g[i][j]=1表示i胜j ，g[j][i]=0 表示j输给iAC代码#include<iostream>#include<algorithm>#include<cstring>using namespace std;const int N=510;in

https://vjudge.net/problem/POJ-1860POJ - 1860 Currency Exchange [spfa + floyd]题目AC代码spfaAC代码 floyd题目Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange o

https://vjudge.net/problem/HDU-2112AC代码#include<iostream>#include<algorithm>#include<cstring>#include<map>using namespace std;const int N=210;int n,m;int g[N][N];int main(){ ios::sync_with_stdio(false); cin.tie(0); cout

https://vjudge.net/problem/HDU-2544HDU - 2544 最短路 dijkstra+spfa题目分析AC代码 spfaAC代码题目在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候，却是非常累的！所以现在他们想要寻找最短的从商店到赛场的路线，你可以帮助他们吗？Input输入包括多组数据。每组数据第一行是两个整数N、M（N<=100，M<=10000），N表示成都的大街上有几个

https://vjudge.net/problem/POJ-1797POJ - 1797 Heavy Transportation 最短路dijstra题目分析AC代码题目BackgroundHugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there reall

https://vjudge.net/problem/POJ-1502POJ - 150 MPI Maelstrom（最短路dijstra）题目分析AC代码题目BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Vale