a709743744的博客

1.spfa计算出最短路 2.如果是最短路上的边的话 uv之间建一条容量为1的边 dist[v]=dist[u]+cost[u][v]就能说明uv是最短路上的一条边 3.跑一边sap #include #include #include #include #include using namespace std; const int MAXN=2222; const int MAXM=333

链接http://acm.hdu.edu.cn/showproblem.php?pid=4571 距离上的cost用floyd算 是否停留用dp求 最后遍历dp[i][j]搜索答案 #include #include #include using namespace std; typedef struct { int c,s,num; }Point; int g[105][105]

Invitation Cards Problem Description In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater

Minimum Transport Cost Problem Description These are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should be del

多加一个判断就好- -#include #include #include using namespace std; const int N = 1000 + 10; const int MAX = 0xfffffff; int map[N][N], cost[N][N]; int min_dist, min_cost; void Dijkstra(int s, int t, int n)

Problem G 没做过这样的题目完全没思路 Problem Description 给定n个点,m条无向边,1为起点,求从起点出发,至少经过两个点(非起点)并且回到最终回到起点的最短路(中途可以经过起点) 点的编号为1到n Input 多组用例 每个用例的第一行是2个整数n和m（2 接下来的m行里，每行包括3个整数a,b,c.代表a和b之间有一条通路，长度为c(0 O

Arbitrage Problem Description Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, supp

Choose the best route Problem Description One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now g

题意： 给出一个n节点m条边的图，设这个图所有点之间最短路之和为sum，然后输出删除每一条边之后的sum值，图不联通输出inf 题解： 第一次计算所有图之间最短路之和的时候 在spfa算法里面记录used[i][j][k]代表以i节点为起点进行spfa操作的时候最短路中经过路径j,k 然后在之后进行删边操作的时候 注意重边 每次都把包含有该条边的也即used[i