C-POJ 1797

方法一 朴素dijkstra

#include <iostream>
#include <cstring>
#define INF 0x3f3f3f3f
using namespace::std;

// 普通dijkstra，O(n^3)，会超时
int T;
int n, m; // 1 <= n <= 1000, n个点, m条边
int dist[1001][1001];
bool visited[1001]; // 已经得到最大容量的点
int most[1001]; // 从1出发到x的最大负重
int dijkstra(void) {
    most[1] = INF;
    visited[1] = 1;
    for (int time = 1; time < n; ++time) { // 重复n-1次可得结果
        int cur_index, cur_max = 0;
        for (int v = 1; v <= n; ++v) { // 已得到最大负重的v
            if (visited[v] == 0) continue;
            for (int x = 2; x <= n; ++x) { // 未得到最大负重的x
                if (visited[x] == 1) continue;
                most[x] = max(most[x], min(most[v], dist[v][x]));
                if (most[x] > cur_max) {
                    cur_max = most[x];
                    cur_index = x;
                }
            }
        }
        if (cur_index == n) return most[n];
        visited[cur_index] = 1;
    }
    return most[n];
}

int main(void) {
    cin >> T;
    for (int t = 1; t <= T; ++t) {
        memset(visited, 0, sizeof(bool) * 1001);
        memset(most, 0, sizeof(int) * 1001);
        cin >> n >> m;
        for (int i = 1; i <= m; ++i) {
            int x, y, dxy;
            cin >> x >> y >> dxy;
            dist[x][y] = dist[y][x] = dxy;
        }
        int ans = dijkstra();
        printf("Scenario #%d:\n", t);
        cout << ans << endl;
    }
    return 0;
}

方法二 dijkstra优化版

#include <iostream>
#include <cstring>
#define INF 0x3f3f3f3f
using namespace::std;

// dijkstra优化版，O(n^2)，做吐了，还是1600ms
int T;
int n, m; // 1 <= n <= 1000, n个点, m条边
int dist[1001][1001];
inline int dijkstra(void) {
    int most[1001] = { 0 }; // 从1出发到x的最大负重
    int visited[1001] = { 0 };
    most[1] = INF;
    visited[1] = 1;
    int v = 1;
    for (int time = 1; time < n; ++time) { // 重复n-1次可得结果
        int cur_index, cur_max = 0; 
        for (int x = 2; x <= n; ++x) { // 未得到最大负重的x
            if (!visited[x]) {
                most[x] = max(most[x], min(most[v], dist[v][x]));
                if (most[x] > cur_max) {
                    cur_max = most[x];
                    cur_index = x;
                }
            }
        }
        if (cur_index == n) return most[cur_index];
        visited[cur_index] = 1;
        v = cur_index;
    }
    return most[n];
}

int main(void) {
    cin >> T;
    for (int t = 1; t <= T; ++t) {
        memset(dist, -1, sizeof(dist));
        cin >> n >> m;
        int x, y, dxy;
        for (int i = 1; i <= m; ++i) {
            cin >> x >> y >> dxy;
            dist[x][y] = dist[y][x] = dxy;
        }
        int ans = dijkstra();
        printf("Scenario #%d:\n", t);
        printf("%d\n\n", ans);
    }
    return 0;
}

方法三 优先队列+dijkstra

#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
const long long INF =  0x3f3f3f3f;
using namespace::std;
typedef pair<int, int> pii;
typedef long long ll;

// O(n^3)会超时，考虑用优先队列优化，配合longlong位操作保存pair，最快还是1600ms
int T;
int n, m; // 1 <= n <= 1000, n个点, m条边
pii table[1001][1001]; // [point][index]=point|weight
bool visited[1001]; // 已经得到最大容量的点
int most[1001]; // 从1出发到x的最大负重
int dijkstra(void) {
    priority_queue<long long> pqu; // weight|point 
    pqu.push((INF << 32) + 1);
    while (!pqu.empty()) {
        long long weightv = pqu.top() >> 32, pointv = (pqu.top() << 32) >> 32;
        pqu.pop();
        if (visited[pointv]) continue;
        visited[pointv] = 1;
        most[pointv] = weightv;
        if (pointv == n) return weightv;
        for (int x = table[pointv][0].first; x >= 1; --x) {
            long long weightvx = table[pointv][x].second, pointx = table[pointv][x].first;
            long long newweight = most[pointv] < weightvx ? most[pointv] : weightvx;
            pqu.push((newweight << 32) + pointx);
        }
    }
    return most[n];
}

int main(void) {
    cin >> T;
    for (int t = 1; t <= T; ++t) {
        memset(table, 0, sizeof(ll) * 1001 * 1001);
        memset(visited, 0, sizeof(visited));
        memset(most, 0, sizeof(most));
        cin >> n >> m;
        for (int i = 1; i <= m; ++i) {
            ll x, y, dxy;
            cin >> x >> y >> dxy;
            table[x][0].first++; table[x][table[x][0].first] = pii(y, dxy);
            table[y][0].first++; table[y][table[y][0].first] = pii(x, dxy);
        }
        int ans = dijkstra();
        printf("Scenario #%d:\n", t);
        printf("%d\n\n", ans);
    }
    return 0;
}