AFreeMan

最短路

BFS(1) CDQ分治和整体二分(1) Codeforces(15) DFS(4) GDUT训练(8) KMP(1) MST(1) RMQ(2) Trie(1) 二分(3) 几何(2) 区间型DP(5) 单调栈(3) 容斥原理(2) 尺取(1) 差分(1) 广工新生赛题解(1) 序列型DP(1) 思维(1) 拓扑排序(1) 排序(3) 搜索(2) 数位DP(5) 数论(9) 无向图双连通分量(1) 未归档(95) 杂(5) 栈/(优先)队列/链表(1) 树形DP(2) 树链剖分(2) 棋盘型DP(4) 概率/期望DP(3) 模拟退火(1) 物理(1) 状压型DP(9) 矩阵快速幂(2) 线性DP(4) 线段树/树状数组(8) 组合数学(1) 缩点(不仅SCC)(1) 网络流(4) 背包型DP(4) 莫队算法(2) 贪心(3) 题解(3)

/ 注册

全部文章 / 最短路（共8篇）

HDU6331 Walking Plan

http://acm.hdu.edu.cn/showproblem.php?pid=6331 Problem Description There are n intersections in Bytetown, connected with m one way streets. Little...

2019-05-22

0 374

[USACO18DEC]Fine Dining

https://www.luogu.org/problemnew/show/P5122 题意：n个点，含有k个干草堆，问前n-1个点到第n个点的【经过任一干草堆的最短路】减去【不加限制的最短路】是否不超过那个干草堆的美味值。思路： ①搞Dijkstra的变形，设d[i][0]为i到n的最短路...

2019-02-17

0 397

poj1511 Invitation Cards

http://poj.org/problem?id=1511 In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of t...

2019-02-04

0 390

poj-1724 ROADS

http://poj.org/problem?id=1724 N cities named with numbers 1 ... N are connected with one-way roads. Each road has two parameters associated with it ...

2019-02-04

0 420

计蒜客百度地图导航

https://nanti.jisuanke.com/t/A1244 百度地图上有 nnn 个城市，城市编号依次为 111 到 nnn。地图中有若干个城市群，编号依次为 111 到 mmm。每个城市群包含一个或多个城市；每个城市可能属于多个城市群，也可能不属于任何城市群。地图中有两类道路。第一...

2019-02-03

0 621

Okabe and City

http://codeforces.com/problemset/problem/821/D Okabe likes to be able to walk through his city on a path lit by street lamps. That way, he doesn't...

2019-02-03

0 401

cf Volleyball

http://codeforces.com/problemset/problem/95/C Petya loves volleyball very much. One day he was running late for a volleyball match. Petya hasn't boug...

2019-01-30

0 466

Roadblocks

http://poj.org/problem?id=3255 Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to...

2019-01-27

0 399