联合权值

http://www.luogu.org/problem/show?pid=1351
我有话说：
直接枚举。不过有一个策略可以优化时间。就是假设一个点和a，b，c等相连，那么ab+ac+ba+bc+ca+cb=(a+b+c)^2-a^2-b^2-c^2;

#include<iostream>
#include<string>
#include<cstring>
#include<sstream>
#include<vector>
#include<algorithm>
#include<queue>
#include<cstdio>
using namespace std;
const int maxn=200000+10;
const int maxv=50000+10;
const int INF=100000000;
const int mod=10007;
vector<int>G[maxn];
int w[maxn];
int main()
{
    int n;
    cin>>n;
    int u,v;
    for(int i=1;i<n;i++){
        scanf("%d%d",&u,&v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    for(int i=1;i<=n;i++)scanf("%d",&w[i]);
    int sum=0,maxw=0;
    for(int i=1;i<=n;i++){
        long long t1=0,t2=0;
        int max1=0,max2=0;
        for(int j=0;j<G[i].size();j++){
            t1+=w[G[i][j]];t2+=w[G[i][j]]*w[G[i][j]];
            if(w[G[i][j]]>max2){
                if(w[G[i][j]]>max1){max2=max1;max1=w[G[i][j]];}
                else max2=w[G[i][j]];
            }
        }
        maxw=max(maxw,max1*max2);
        sum=(long long)(sum+t1*t1-t2)%mod;
    }
    printf("%d %d\n",maxw,sum);
    return 0;
}