MPI Maelstrom POJ - 1502

最新推荐文章于 2022-03-13 18:41:37 发布

GUESSERR

最新推荐文章于 2022-03-13 18:41:37 发布

阅读量207

点赞数

分类专栏： Spfa

本文链接：https://blog.csdn.net/weixin_44417851/article/details/108058298

版权

Spfa 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

MPI Maelstrom POJ - 1502

题意：大致意思是1到其他点的最短距离中最大的那个距离是多少。
可以用的算法：Floyd，Dijkstar，Bellman-Ford，Spfa
~~个人这道题用了Spfa，因为上道题用了Spfa，不想重写了，嘿嘿嘿~~

#include<iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <functional>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <sstream>
#include <algorithm>
#define ll long long
#define PI acos(-1)
#define mes(x,y) memset(x,y,sizeof(x))
#define lp pair<ll, ll>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const ll inf = 10000000000000005;
ll n, m, i, j, k = 0, t, w, flag, x, y, z, sum;
string s1, s2, s;
struct node {
	ll end, len;;
	node(ll x, ll y) :end(x), len(y){}
};
vector <vector<node> >v;
ll dis[110];
ll ismove[110];
ll StrTurnNum(string s) {
	sum = 0;ll i = 0;
	while (i < s.length())sum = (ll(s[i++] - '0'))+sum* 10;
	return sum;
}
ll Spfa(ll beginkind) {
	mes(dis, inf); mes(ismove, 0); queue<ll>que;
	dis[beginkind] = 0; que.push(beginkind);
	while (!que.empty()) {
		t = que.front(); que.pop(); ismove[t] = 0;
		for (i = 0; i < v[t].size(); i++) {
			if (dis[v[t][i].end] > dis[t] + v[t][i].len) {
				dis[v[t][i].end] = dis[t] + v[t][i].len;
				if (ismove[v[t][i].end] == 0) que.push(v[t][i].end);
				ismove[v[t][i].end] = 1;
			}
		}
	}
	for (i = 2, j = dis[1]; i <= n; i++)j = max(j, dis[i]);
	return j;
}
int main() {
	cin >> n;
	for (i = 2,v.resize(n+1); i <= n; i++) {
		for (j = 1; j < i; j++) {
			cin >> s;
			if (s == "x")continue;
			else {
				v[i].push_back(node(j, StrTurnNum(s)));
				v[j].push_back(node(i, StrTurnNum(s)));
			}
		}
	}
	cout << Spfa(1) << endl;
	return 0;
}