codeforces 25C Roads in Berlands(Floyd松弛优化)

https://codeforces.com/problemset/problem/25/C

弗洛伊德变形题，之前做过一道类似的省赛的题，如果每次给定一条边都重新跑一遍floyd时间复杂度高达1e12

上一道题是松弛一个点，这道题给定一条边，所以我们松弛两个点，即这条边的起点和终点

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 305;
int a[maxn][maxn];
int n, m;
int main()
{
    while(scanf("%d", &n) != EOF)
    {
        for(int i = 1; i <= n; i ++)
            for(int j = 1; j <= n; j ++)
                scanf("%d", &a[i][j]);
        scanf("%d", &m);
        while(m --)
        {
            ll ans = 0;
            int u, v, w;
            scanf("%d%d%d", &u, &v, &w);
            if(w < a[u][v])
            {
                a[u][v] = a[v][u] = w;
                for(int i = 1; i <= n; i ++)
                    for(int j = 1; j <= n; j ++)
                       a[j][i] = a[i][j] = min(a[i][j], a[i][u] + a[u][j]);
                for(int i = 1; i <= n; i ++)
                    for(int j = 1; j <= n; j ++)
                       a[j][i] = a[i][j] = min(a[i][j], a[i][v] + a[v][j]);
            }
            for(int i = 2; i <= n; i ++)
                for(int j = 1; j < i; j ++)
                    ans += a[i][j];
            printf("%lld\n", ans);
        }
    }
    return 0;
}