Codeforces Round #202 (Div. 1) B. Apple Tree CF348B

对每个点平分数值的话 一定要满足他底下的所有子树能平分
所以考虑对每个节点求一个lcm 并且求儿子中的最小值
然后再用最小值来确定最多可以留下多少

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
#include <ctime>
#include <bitset>
using namespace std;
#define pb push_back
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define ans() printf("%d",ans)
#define ansn() printf("%d\n",ans)
#define anss() printf("%d ",ans)
#define lans() printf("%lld",ans)
#define lanss() printf("%lld ",ans)
#define lansn() printf("%lld\n",ans)
#define fansn() printf("%.10f\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define rsz(i,v) for(int i=0;i<(int)v.size();++i)
#define szz(x) ((int)x.size())
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pli pair<ll,int>
#define pll pair<ll,ll>
#define mp(aa,bb) make_pair(aa,bb)
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
#define sqr(a) ((a)*(a))
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1000000000+7;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
const ll infl = 10000000000000000;
const int maxn=  100000+10;
const int maxm = 40000+10;
//Pretests passed
int in(int &ret)
{
    char c;
    int sgn ;
    if(c=getchar(),c==EOF)return -1;
    while(c!='-'&&(c<'0'||c>'9'))c=getchar();
    sgn = (c=='-')?-1:1;
    ret = (c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
    ret *=sgn;
    return 1;
}

vector<int>g[maxn];
ll a[maxn];
ll mx[maxn];
ll cnt[maxn];
ll lcm(ll a, ll b)
{
    return a/__gcd(a,b)*b;
}
void dfs(int u,int f)
{
    int sz = g[u].size();
    int son = 0;
    r0(i,sz)
    {
        int v = g[u][i];
        if(v==f)continue;
        dfs(v,u);
        if(!son)mx[u] = mx [v] , cnt[u] = cnt[v];
        else
        {
            if(cnt[u]<5e13)cnt[u] = lcm(cnt[u],cnt[v]);
            mx[u] = min(mx[u],mx[v])/cnt[u]*cnt[u];
        }
        son++;
    }
    if(!son)cnt[u] = 1, mx[u] = a[u];
    else
    {
        mx[u]*=son;
        if(cnt[u]<5e13)cnt[u]*=son;
    }
}
int main()
{
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL

    int n;
    sd(n);
    ll tot = 0;
    r1(i,n)sld(a[i]),tot+=a[i];
    r1(i,n-1)
    {
        int u,v;
        sdd(u,v);
        g[u].pb(v);
        g[v].pb(u);
    }
    dfs(1,0);

    ll ans = tot - mx[1];
    lansn();
    return 0;
}