图论-最短路
偷吃了老鼠的土豆
戒骄戒躁,脚踏实地,坚持不懈,愈挫愈勇。
展开
-
kuangbin系列之最短路联系(MPI Maelstrom )
BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee's research advi...原创 2018-07-16 00:16:20 · 147 阅读 · 0 评论 -
president's path(floyd+dp)
题目: Good old Berland has n cities and m roads. Each road connects a pair of distinct cities and is bidirectional. Between any pair of cities, there is at most one road. For each road, we know its len...原创 2018-07-25 22:05:09 · 302 阅读 · 0 评论 -
transaction transaction transaction (SPFA)
题目:https://vjudge.net/contest/241123#problem/C Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in memory of a great man, citizens will read a book n...原创 2018-07-25 17:23:40 · 154 阅读 · 0 评论 -
Invitation Cards(dijkstra算法+堆优化)Poj 1151
题目:http://poj.org/problem?id=1511 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 and, m...原创 2018-07-18 20:20:11 · 282 阅读 · 0 评论 -
POJ3660cow contest(floyd求传递闭包)
Cow Contest N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than others. Each cow has a certain constant skill rati...原创 2018-07-17 16:16:25 · 89 阅读 · 0 评论 -
最短路Flord:kuangbin系列之最短路B
题目传送门:Frogger利用了Flord算法:算法讲解参考:福利题目大意,在两个石头之间找到最短路径#include <iostream> #include<stdio.h> #include <vector> #include <algorithm> #include <math.h> #include <iomanip>...原创 2018-06-05 00:21:29 · 254 阅读 · 0 评论 -
CCF-20180904(再卖菜)
题目:问题描述 在一条街上有n个卖菜的商店,按1至n的顺序排成一排,这些商店都卖一种蔬菜。 第一天,每个商店都自己定了一个正整数的价格。店主们希望自己的菜价和其他商店的一致,第二天,每一家商店都会根据他自己和相邻商店的价格调整自己的价格。具体的,每家商店都会将第二天的菜价设置为自己和相邻商店第一天菜价的平均值(用去尾法取整)。 注意,编号为1的商店只有一个相邻的商店2,编号为n的商店只...原创 2019-03-16 17:09:39 · 228 阅读 · 0 评论