BZOJ 4152 [AMPPZ2014]The Captain 最短路题解
2017-07-05 00:55
357 查看
Time Limit: 20 Sec Memory Limit: 256 MB
Submit: 1108 Solved: 433
接下来n行,每行包含两个整数x[i],y[url=0
Submit: 1108 Solved: 433
Description
给定平面上的n个点,定义(x1,y1)到(x2,y2)的费用为min(|x1-x2|,|y1-y2|),求从1号点走到n号点的最小费用。Input
第一行包含一个正整数n(2<=n<=200000),表示点数。接下来n行,每行包含两个整数x[i],y[url=0
相关文章推荐
- BZOJ 4152: [AMPPZ2014]The Captain
- BZOJ 4152: [AMPPZ2014]The Captain(最短路)
- BZOJ 4152: [AMPPZ2014]The Captain( 最短路 )
- BZOJ 4152: [AMPPZ2014]The Captain 分层图最短路
- 循环队列+堆优化dijkstra最短路 BZOJ 4152: [AMPPZ2014]The Captain
- BZOJ[4152][AMPPZ2014]The Captain Dijkstra
- bzoj 4144 [AMPPZ2014]Petrol 最短路+最小生成树+倍增
- bzoj 4152: [AMPPZ2014]The Captain
- 【BZOJ】【4152】【AMPZZ2014】The Captain
- [BZOJ 4152] The Captain 最短路(Dijkstra版)
- 【bzoj4152】【AMPPZ2014】【The Captain】【最短路】
- bzoj4152[AMPPZ2014]The Captain 最短路
- BZOJ4152 AMPPZ2014 The Captain(最短路)
- BZOJ 4152: [AMPPZ2014]The Captain 题解 【贪心】【SPFA】
- 【BZOJ4152】[AMPPZ2014]The Captain 最短路
- BZOJ 4152 [AMPPZ2014]The Captain dijkstra
- BZOJ4144 [AMPPZ2014]Petrol 【最短路 + 最小生成树】
- bzoj4152 [AMPPZ2014]The Captain
- 【bzoj4145】[AMPPZ2014]The Prices 状压dp
- 【AMPPZ2014】【BZOJ4143】The Lawyer