poj 1673 次小生成树

 

 

 

#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>

using namespace std;

const int inf = 99999999;
//int maxe[102];
int cost[102][102];
int len[102][102];
int dist[102];
int s[102];
int p[102];

int choose(int n)
{
    int pos = -1;
    int tmp = inf;
    for(int i = 0 ; i < n  ;  i++ )
        if ( !s[i]  && dist[i] < tmp)
        {
            pos = i ;
            tmp = dist[i];
        }
    return pos;
}

int maxv(int a, int b )
{
    if ( a > b )
        return a;
    else
        return b;
}

int next_prim(int n)
{
    int weight = 0;

    for(int i = 0 ; i < n; i++ )
        s[i] = 0,dist[i] = inf,len[i][i] = 0;

    s[0] = 1;
    dist[0] = 0 ;
    p[0] = 0;

    for(int i = 1; i < n; i++)
        dist[i] = cost[0][i],p[i] = 0;

    while(1)
    {
        int u = choose(n);

        if( u == -1 )
            break;
        len[p[u]][u] = len[u][p[u]] = cost[p[u]][u];

        for(int i = 0 ; i < n; i ++ )
            if( s[i] )
                len[i][u] = len [u][i] = maxv(len[i][p[u]],len[p[u]][u]);

        s[u] = 1 ;
        weight += cost[p[u]][u];

        for(int i = 0 ; i < n; i++ )
            if(!s[i] && dist[i] > cost[u][i])
            {
                 dist[i] = cost[u][i];
                p[i] = u;
            }
    }
    return weight;
}

int main()
{
    int t,xi,yi,wi;
    int n,m;
    int mst,next_mst;
    cin >> t;
    while( t-- )
    {
        cin >> n >> m;
        for(int i = 0 ; i < n; i++ )
            for(int j = 0 ;j < n; j++ )
                cost[i][j] = cost[j][i] = inf;

        for(int i = 0 ; i < m ; i++ )
        {
            cin >> xi >> yi >> wi;
            cost[xi-1][yi-1] = cost[yi-1][xi-1] = wi;
        }

        mst = next_prim( n ) ;
        next_mst = inf;

        for(int i = 0 ; i < n ; i++ )
            for(int j = i+1 ; j < n ; j++)
                if( p[i] !=j && p[j] != i && cost[i][j] < inf )
                    if(next_mst > mst + cost[i][j] - len[i][j] )
                        next_mst = mst + cost[i][j] - len[i][j];
        if(next_mst == mst )
            cout << "Not Unique!" << endl;
        else
            cout << mst << endl;
    }
    return 0;
}
 原来做过的题目， 就是枚举不在路径上的边 然后减去所在环的最大的边 得到的就是次小生成树。
len记录在树上i到j的最长路径。
而且发现原来的写错了 也ac了 因为本题就是求一个次小树和最小树时候相等的问题，所以符号写错了 也ac了。