最短路问题
文章平均质量分 89
muyu__
这个作者很懒,什么都没留下…
展开
-
POJ 2387 Til the Cows Come Home(SPFA||Dijkstra)
POJ 2387 Til the Cows Come Home Description Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie n...原创 2018-10-31 20:38:52 · 151 阅读 · 0 评论 -
POJ 3268 Silver Cow Party(spfa)
Silver Cow Party Language: Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 30402 Accepted: 13798 Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numb...原创 2018-11-14 18:35:23 · 182 阅读 · 0 评论 -
LightOJ - 1074 Extended Traffic(spfa+判负环)
Dhaka city is getting crowded and noisy day by day. Certain roads always remain blocked in congestion. In order to convince people avoid shortest routes, and hence the crowded roads, to reach destinat...原创 2018-11-14 19:58:45 · 212 阅读 · 0 评论 -
POJ 1860 Currency Exchange(spfa)
POJ 1860 Currency Exchange Description Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operation...原创 2018-11-14 20:46:37 · 258 阅读 · 0 评论 -
POJ 3159 Candies(差分约束)
POJ 3159 Candies Description During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flym...原创 2018-11-19 20:06:46 · 112 阅读 · 0 评论 -
HDU 4725 The Shortest Path in Nya Graph(SPFA)
This is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algoritmo. If you do not understand a word of this paragraph, just ...原创 2018-11-24 16:01:29 · 105 阅读 · 0 评论 -
【模板】Floyd的优化
#include<iostream> #include<cstdio> #include<cstring> using namespace std; int dp[105][105]; int main() { int n,m; scanf("%d%d",&n,&m); memset(dp,63,sizeof(dp)); ...原创 2019-08-24 17:08:39 · 293 阅读 · 0 评论