HDU-1055 Color a Tree（贪心策略）

HDU-1055 Color a Tree（贪心策略）

Color a Tree

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3691 Accepted Submission(s): 1359

Problem Description
Bob is very interested in the data structure of a tree. A tree is a directed graph in which a special node is singled out, called the “root” of the tree, and there is a unique path from the root to each of the other nodes.

Bob intends to color all the nodes of a tree with a pen. A tree has N nodes, these nodes are numbered 1, 2, …, N. Suppose coloring a node takes 1 unit of time, and after finishing coloring one node, he is allowed to color another. Additionally, he is allowed to color a node only when its father node has been colored. Obviously, Bob is only allowed to color the root in the first try.

Each node has a “coloring cost factor”, Ci. The coloring cost of each node depends both on Ci and the time at which Bob finishes the coloring of this node. At the beginning, the time is set to 0. If the finishing time of coloring node i is Fi, then the coloring cost of node i is Ci * Fi.

For example, a tree with five nodes is shown in Figure-1. The coloring cost factors of each node are 1, 2, 1, 2 and 4. Bob can color the tree in the order 1, 3, 5, 2, 4, with the minimum total coloring cost of 33.

Given a tree and the coloring cost factor of each node, please help Bob to find the minimum possible total coloring cost for coloring all the nodes.

Input
The input consists of several test cases. The first line of each case contains two integers N and R (1 <= N <= 1000, 1 <= R <= N), where N is the number of nodes in the tree and R is the node number of the root node. The second line contains N integers, the i-th of which is Ci (1 <= Ci <= 500), the coloring cost factor of node i. Each of the next N-1 lines contains two space-separated node numbers V1 and V2, which are the endpoints of an edge in the tree, denoting that V1 is the father node of V2. No edge will be listed twice, and all edges will be listed.

A test case of N = 0 and R = 0 indicates the end of input, and should not be processed.

Output
For each test case, output a line containing the minimum total coloring cost required for Bob to color all the nodes.

Sample Input
5 1
1 2 1 2 4
1 2
1 3
2 4
3 5
0 0

题意：

这道题在模拟赛的时候没做出来，对于我这种脑子一卡一卡的人来说，贪心策略属实太难了，尤其是这道题，可以算是中上难度的贪心题目了，辛亏他没有让我们存树之类结构的操作，不然直接会阻碍我们截图速度。
大致思路就是我们每次找到除根节点外目前图中最大的结点，由于要涂它，那么肯定要先涂他的父亲结点，我们可以将这两个结点融为一个结点，将此点的所有值（总成本，时间）都加给父亲结点，并将自己清空，再把自己的儿子结点的父亲结点变成自己的父亲结点。

//这为值的赋值
            trie[newf].c=trie[newf].c+trie[pos].c;
            trie[newf].t=trie[newf].t+trie[pos].t;
            trie[newf].w=(double)trie[newf].c/trie[newf].t;

什么时候融合结束呢，一直融合n-1次（根结点不融所以n-1),
至于如何求出结果：初始时使sum = sum(p[i].c)；每次查找到一个最大权值，sum+=trie[pos].c*trie[newf].t;

看代码会好懂一些；
具体看下面代码

//较难的贪心策略
#include<iostream>
#include<algorithm>
#include<cstring>
#define FASTIO  ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const int N=1e3+10;
int n,r;

struct 
{
   int c,t,f;
   double w;
}trie[N];

int find(){
    double max=0;//max必须为double
    int pe;
    for(int i=1;i<=n;i++)
        if(trie[i].w>max && i!=r)//pe不能为根节点
    {
        max=trie[i].w;
         pe=i;
    }
    return pe;

}
int main(){
    FASTIO;
    while(cin>>n>>r&&n!=0&&r!=0){

        int sum=0;
        for(int i=1;i<=n;i++){
            cin>>trie[i].c;
            trie[i].t=1;
            trie[i].w=trie[i].c;
            sum+=trie[i].c;
        }
        for(int i=1;i<=n-1;i++){
            int a,b;
            cin>>a>>b;
            trie[b].f=a;
        }

        int res=n;

        while(res>1){
            int pos=find();
            trie[pos].w=0;
            int newf=trie[pos].f;

            sum+=trie[pos].c*trie[newf].t;

            for(int i=1;i<=n;i++)
                if(trie[i].f==pos)
                    trie[i].f=newf;
            
            trie[newf].c=trie[newf].c+trie[pos].c;
            trie[newf].t=trie[newf].t+trie[pos].t;
            trie[newf].w=(double)trie[newf].c/trie[newf].t;
            res--;

        }
        cout<<sum<<endl;
        
    }
    return 0;
}