zoukankan      html  css  js  c++  java
  • [POJ 1655]Balancing Act

    Balancing Act
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 16604   Accepted: 7037

    Description

    Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more trees. Define the balance of a node to be the size of the largest tree in the forest T created by deleting that node from T. 
    For example, consider the tree: 

    Deleting node 4 yields two trees whose member nodes are {5} and {1,2,3,6,7}. The larger of these two trees has five nodes, thus the balance of node 4 is five. Deleting node 1 yields a forest of three trees of equal size: {2,6}, {3,7}, and {4,5}. Each of these trees has two nodes, so the balance of node 1 is two. 

    For each input tree, calculate the node that has the minimum balance. If multiple nodes have equal balance, output the one with the lowest number. 

    Input

    The first line of input contains a single integer t (1 <= t <= 20), the number of test cases. The first line of each test case contains an integer N (1 <= N <= 20,000), the number of congruence. The next N-1 lines each contains two space-separated node numbers that are the endpoints of an edge in the tree. No edge will be listed twice, and all edges will be listed.

    Output

    For each test case, print a line containing two integers, the number of the node with minimum balance and the balance of that node.

    Sample Input

    1
    7
    2 6
    1 2
    1 4
    4 5
    3 7
    3 1
    

    Sample Output

    1 2

    Source

    简单一点就是求树的重心,用s[i]记录以i为子树下面有多少个节点

    用maxn记录每次值即可

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<cmath>
    using namespace std;
    inline int read()
    {
        int f=1,ans=0;char c;
        while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
        while(c>='0'&&c<='9'){ans=ans*10+c-'0';c=getchar();}
        return f*ans;
    }
    struct node{
        int u,v,nex;
    }x[40001];
    int head[20001],cnt=0;
    int s[20001],n,maxn[20001];
    void add(int u,int v)
    {
        x[cnt].u=u,x[cnt].v=v,x[cnt].nex=head[u],head[u]=cnt++;
    }
    void dfs(int f,int fath)
    {
        s[f]=1;
        for(int i=head[f];i!=-1;i=x[i].nex)
        {
            int p=x[i].v;
            if(p==fath) continue;
            dfs(p,f);
            s[f]+=s[p];
            maxn[f]=max(s[p],maxn[f]);
        }
        maxn[f]=max(maxn[f],n-s[f]); 
        return;
    }
    int main()
    {
        int t=read();
        while(t--)
        {
            memset(head,-1,sizeof(head));
            memset(maxn,0,sizeof(maxn));
            cnt=0;
            memset(s,0,sizeof(s));
            memset(x,0,sizeof(x));
            n=read();
            for(int i=1;i<n;i++)
            {
                int u=read(),v=read();
                add(u,v),add(v,u);
            }
            dfs(1,-1);
            int sry=2<<30-1;
            for(int i=1;i<=n;i++) sry=min(sry,maxn[i]);
            for(int i=1;i<=n;i++)
                if(maxn[i]==sry)
                {
                    cout<<i<<" "<<sry<<endl;
                    break;
                }
        }
    }
    View Code
  • 相关阅读:
    chrome headless+selenium+python+(ubuntu 16.04/centos7) 下的实现
    selenium + phantomJS 常用方法总结
    Rabbitmq consumer端超时报错
    python 守护进程
    如何在GitBook中使用Git管理
    Java#Spring框架下注解解析
    Linux 之Ubuntu在VM中安装(桌面版)
    Linux----Ubuntu虚拟机(VMWare)学习
    Python tuple元组学习
    Python 编解码
  • 原文地址:https://www.cnblogs.com/si-rui-yang/p/9520838.html
Copyright © 2011-2022 走看看