HDU - 5414 CRB and String（字符串思维）

题目链接: [CRB and String]

---

大致题意:

给你两个字符串s和t，你可以在字符串s中任意选一个字符c，在该字符c后插入一个字符d(d!=c)，问经过多次此操作，能否将字符串s转化成字符串t

---

解题思路:

两个条件：

1.若字符串t前k个字符都相同，那么字符串s的前k个字符也必须相同，s=aabcd t=aabcde 是可以转化的，而s=aabcd t=aaabcd 则是不可以转化的，首字符相等并且ls>=lt才可以
2.s串是t串的子串

满足上面两个条件就可以转化

---

AC代码:

#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
typedef long long ll;
using namespace std;
const int N = 3e5 + 5;
const int INF = 0x3f3f3f3f;
int vis[N];
vector<pair<int, int>>e[N];
int dis[N];
int a[N];
int n, m, c;
struct node {
	int u, w;
	node(int u = 0, int w = 0) :u(u), w(w) {}
	bool operator <(const node& r)const {
		return w > r.w;
	}
};
void spfa() {
	memset(vis, 0, sizeof vis);
	memset(dis, INF, sizeof dis); dis[1] = 0;
	priority_queue<node>q;
	while (!q.empty())q.pop();
	q.push(node(1, dis[1]));
	while (!q.empty()) {
		node tmp = q.top(); q.pop();
		int u = tmp.u;
		if (vis[u])continue;
		vis[u] = 1;
		for (int i = 0; i < e[u].size(); ++i) {
			int v = e[u][i].first; int w = e[u][i].second;
			if (dis[v] > dis[u] + w && !vis[v]) {
				dis[v] = dis[u] + w;
				q.push(node(v, dis[v]));
			}
		}
	}
	if (dis[n] == INF)printf("-1\n");
	else printf("%d\n", dis[n]);
}
int main(void)
{
	int k = 1;
	int t; scanf("%d", &t);
	while (t--) {
		for (int i = 1; i <= 3 * n; ++i)e[i].clear();
		scanf("%d%d%d", &n, &m, &c);
		int x;
		for (int i = 1; i <= n; ++i) {
			scanf("%d", &x);
			e[x * 2 + n - 1].push_back(make_pair(i, 0)); //入点
			e[i].push_back(make_pair(x * 2 + n, 0));   //出点
		}
		for (int i = 1; i <= n; ++i) {
			int u = 2 * i + n;  //出点
			if (i > 1) {
				int v = u - 3;  // 该层的出点,到上一层的入点
				e[u].push_back(make_pair(v, c));
			}
			if (i < n) {
				int v = u + 1;  // 该层的出点,到下一层的入点
				e[u].push_back(make_pair(v, c));
			}
		}
		int u, v, w;
		for (int i = 1; i <= m; ++i) {
			scanf("%d%d%d", &u, &v, &w);
			e[u].push_back(make_pair(v, w));
			e[v].push_back(make_pair(u, w));
		}
		printf("Case #%d: ", k++);
		spfa();
	}
	return 0;
}

END