HDU 4700 Flow (贪心)

把所有的边排序，然后选择最大的边构成一个图，当添加一条边之后会联通两个部分，分别从两个部分中任取一点，计算其流量。

比赛的时候我把边从小到大排序，sb了，，

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <string>

#define LL long long
#define DB double
#define SI(a) scanf("%d",&a)
#define SD(a) scanf("%lf",&a)
#define SS(a) scanf("%s",a)
#define SF scanf
#define PF printf
#define MM(a,b) memset(a,b,sizeof(a))
#define REP(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define N 109
#define INF 0x3f3f3f3f
#define EPS 1e-8
#define bug puts("bug")
using namespace std;
int fa[N];
int finfa(int k)
{
    if(fa[k]==k) return k;
    return fa[k] = finfa(fa[k]);
}

int n;
struct TTT{
    int l,r,val;
    bool operator<(const TTT t) const
    {
        return val>t.val;
    }
} re[N*N];
int ans[N][N];
int dp[N][N];
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    while(~SI(n))
    {
        int cnt = 0,a;
        REP(i,0,n+1) fa[i] = i;
        REP(i,1,n+1)
        {
            REP(j,1,n+1)
            {
                SI(a);
                if(j>i)
                {
                    re[cnt].l= i;
                    re[cnt].r = j;
                    re[cnt++].val = a;
                }
            }
        }
        sort(re,re+cnt);
        int flag = 0;
        MM(dp,-1);
        MM(ans,0);
        REP(i,0,n+1) dp[i][i] = INF;

        REP(i,0,cnt)
        {
            int l = re[i].l,r = re[i].r;
            if(finfa(l)==finfa(r))
            {
                if(dp[l][r] != re[i].val) flag = 1;
                else
                continue;
            }
            if(flag) break;
            if(finfa(l)!=finfa(r))
            fa[finfa(l)] = finfa(r);
            //cout<<re[i].val<<endl;
            dp[l][r] = re[i].val;
            dp[r][l] = re[i].val;
            ans[l][r] = re[i].val;
            ans[r][l] = re[i].val;
            REP(j,1,n+1)
            REP(k,j+1,n+1)
            if(finfa(j)==finfa(k)&&dp[j][k]==-1)
            {
                int c1 = max(dp[j][l],dp[j][r]);
                int c2 = max(dp[k][l],dp[k][r]);
                dp[j][k] = dp[k][j] = min(re[i].val,min(c1,c2));
            }
        }
        if(flag) puts("NO");
        else
        {
            puts("YES");
            REP(i,1,n+1)
            {
               REP(j,1,n+1)
                {
                    if(j>1) PF(" ");
                    if(i==j)
                    {
                        PF("-1");
                    }else
                    {
                        PF("%d",ans[i][j]);
                    }
                }
                PF("\n");
            }
        }
    }
    return 0;
}