Anna, Svyatoslav and Maps (图论)

Anna, Svyatoslav and Maps

题目链接

大致题意:

给出一个有向无环图DAG和一个序列表示路径,要求序列的一个最短子序列,使得子序列的每一个点到下一个点走最短路形成的序列就是原序列

---

解题思路:

考虑删掉哪些点后跑最短路形成的序列还是原序列

floyd求出任意两点间距离,p[1]和p[m]是必选的,剩下的点一个个考虑

设上一个选了的点为p[x]，当前节点为p[i]，那么当且仅当p[x]与p[i]之间的最短距离dis[p[x],p[i]]小于按路径p上的顺序走p[x]与p[i]的距离，我们才需要选中p[i],遍历一遍即可

---

AC代码:

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); ++i)
#define debug(a) cout << #a << " = " << a << endl;
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 110, M = 1e6 + 10;
int n, m;
int dis[N][N];
int p[M];
int main(void)
{
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j) {
			scanf("%1d", &dis[i][j]);
			if (!dis[i][j] && (i != j))dis[i][j] = INF;
		}
	//floyd
	for (int k = 1; k <= n; ++k)
		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= n; ++j)
				dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
	scanf("%d", &m);
	for (int i = 1; i <= m; ++i)scanf("%d", &p[i]);
	int last = p[1], d = 0;
	vector<int>res;  res.push_back(p[1]);
	for (int i = 2; i <= m; ++i) {
		d += dis[p[i - 1]][p[i]];
		if (d > dis[last][p[i]]) {
			last = p[i - 1];
			res.push_back(last);
			d = dis[last][p[i]];
		}
	}
	res.push_back(p[m]);
	printf("%d\n", res.size());
	for (auto& op : res) printf("%d ", op);
	return 0;
}

---