hdu3072 Intelligence System

英语是硬伤啊， 每次都看不懂题意，各种查题意；
题意； 一点到另一点传消息， 两点间有费用， （每个强两通间不许要费用） 求消息传到个点，需要的最小费用，看懂题以后很简单 ；直接强联通缩点， 求最小费用；

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>

using namespace std;

const int M = 50005;
const int N = 100005;
struct node {

    int to;
    int value;
    int next;

}num[N];

int ins[M];
int belong[M];
int dfn[M];
int low[M];
int rdu[M];
int sccf[M];
int head[M];
int sum[M];
stack<int>s;
int index, cont;
int ans;
int T, n, m, e, e1;

void init() {

    e = 0;
    index = 1;
    cont = 0;
    e1 = 0;
    memset(num, 0, sizeof(num));
    memset(head, -1, sizeof(head));
    memset(dfn, 0, sizeof(dfn));
    memset(low, 0, sizeof(low));
    memset(sccf, 0, sizeof(sccf));
    memset(rdu, 0, sizeof(rdu));
    memset(belong, 0, sizeof(belong));

}
void add(int a, int b, int d) {

    num[e].to = b;
    num[e].value = d;
    num[e].next = head[a];
    head[a] = e++;
}

void Tanjian(int u) {  //缩点，

    int v;
    dfn[u] = low[u] = index++;
    ins[u] = 1;
    s.push(u);
    for(int k = head[u]; k != -1; k = num[k].next) {

        v = num[k].to;
        if(!dfn[v]) {

            Tanjian(v);
            low[u] = min(low[u], low[v]);
        }
        else if(ins[v]) {

            low[u] = min(low[u], low[v]);
        }
    }
    if(low[u] == dfn[u]) {

        cont++;
        do {

            v = s.top();
            s.pop();
            sccf[v] = cont;
            belong[cont]++;   //存储没给缩点所包函的节点数，
            ins[v] = 0;

        }while(u != v);
    }
}

int main()
{
    int a, b, d;
    while(scanf("%d%d", &n, &m) != EOF) {
    init();
    for(int i = 0; i < m; i++) {

        scanf("%d%d%d", &a, &b, &d);
           add(a, b, d);
    }
    for(int i = 0; i < n; i++) {

        if(!dfn[i]) {

            Tanjian(i);
        }
    }
    for(int i = 1; i <= cont ; i++) {

        sum[i] = 999999999;
    }
    for(int i = 0; i < n; i++) {

        for(int k = head[i]; k != -1; k = num[k].next) {

            int u = num[k].to;
            int v = num[k].value;

            if(sccf[i] != sccf[u]) {

                sum[sccf[u]] = min(sum[sccf[u]], v); //求一个强连通到另一个强联通的最小费用，
            }
        }
    }
    int ans = 0;
    for(int i = 1; i <= cont; i++) {

        if(sum[i] !=  999999999) {

            ans += sum[i];
        }
    }

    printf("%d\n", ans);

  }
    return 0;
}