反思:
string s;
cin >> s;
int w = atoi(s.c_str());
字符串转成整形的代码,头文件algorithm
#include <iostream>
#include <queue>
#include <cstdio>
#include <map>
#include <cstring>
#include <stack>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
const int INF = 1 << 30;
const int maxn = 110;
struct Node
{
int v;
int w;
Node(){}
Node(int vv, int ww) : v(vv), w(ww) {}
};
int n;
vector<vector<Node> > G;
int dis[maxn];
int vis[maxn];
void Init()
{
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; i++) {
dis[i] = INF;
}
G.resize(n + 1);
for (int i = 1; i <= n; i++) {
G[i].clear();
}
}
int SPFA()
{
queue<int> q;
q.push(1);
dis[1] = 0;
vis[1] = 1;
while (!q.empty()) {
int t = q.front();
q.pop();
vis[t] = 0;
for (int i = 0, j = G[t].size(); i < j; i++) {
Node tmp = G[t][i];
int md = tmp.w + dis[t];
if (md < dis[tmp.v]) {
dis[tmp.v] = md;
if (!vis[tmp.v]) {
q.push(tmp.v);
vis[tmp.v] = 1;
}
}
}
}
return 0;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
#endif // ONLINE_JUDGE
cin >> n;
Init ();
for (int i = 2; i <= n; i++) {
for (int j = 1; j < i; j++) {
string s;
cin >> s;
if (s[0] == 'x') continue;
int w = atoi(s.c_str());
G[i].push_back(Node(j, w));
G[j].push_back(Node(i, w));
}
}
SPFA();
int md = 0;
for (int i = 2; i <= n; i++) {
if (md < dis[i]) md = dis[i];
}
cout << md << endl;
return 0;
}