zoukankan      html  css  js  c++  java
  • hdoj 4081 次小生成树

    Problem Description
    During the Warring States Period of ancient China(476 BC to 221 BC), there were seven kingdoms in China ---- they were Qi, Chu, Yan, Han, Zhao, Wei and Qin. Ying Zheng was the king of the kingdom Qin. Through 9 years of wars, he finally conquered all six other kingdoms and became the first emperor of a unified China in 221 BC. That was Qin dynasty ---- the first imperial dynasty of China(not to be confused with the Qing Dynasty, the last dynasty of China). So Ying Zheng named himself "Qin Shi Huang" because "Shi Huang" means "the first emperor" in Chinese.
    Qin Shi Huang undertook gigantic projects, including the first version of the Great Wall of China, the now famous city-sized mausoleum guarded by a life-sized Terracotta Army, and a massive national road system. There is a story about the road system: There were n cities in China and Qin Shi Huang wanted them all be connected by n-1 roads, in order that he could go to every city from the capital city Xianyang. Although Qin Shi Huang was a tyrant, he wanted the total length of all roads to be minimum,so that the road system may not cost too many people's life. A daoshi (some kind of monk) named Xu Fu told Qin Shi Huang that he could build a road by magic and that magic road would cost no money and no labor. But Xu Fu could only build ONE magic road for Qin Shi Huang. So Qin Shi Huang had to decide where to build the magic road. Qin Shi Huang wanted the total length of all none magic roads to be as small as possible, but Xu Fu wanted the magic road to benefit as many people as possible ---- So Qin Shi Huang decided that the value of A/B (the ratio of A to B) must be the maximum, which A is the total population of the two cites connected by the magic road, and B is the total length of none magic roads. Would you help Qin Shi Huang? A city can be considered as a point, and a road can be considered as a line segment connecting two points.
     
    Input
    The first line contains an integer t meaning that there are t test cases(t <= 10). For each test case: The first line is an integer n meaning that there are n cities(2 < n <= 1000). Then n lines follow. Each line contains three integers X, Y and P ( 0 <= X, Y <= 1000, 0 < P < 100000). (X, Y) is the coordinate of a city and P is the population of that city. It is guaranteed that each city has a distinct location.
     
    Output
    For each test case, print a line indicating the above mentioned maximum ratio A/B. The result should be rounded to 2 digits after decimal point.
     
    这是写给我自己看的,怕忘了,只贴ac代码,别的啥都没有,想看题解的可以撤了。
    #include<iostream>
    #include<cmath>
    #include<cstring>
    #include<cstdio>
    #define MAX 1010
    using namespace std;
    struct City
    {
        int x,y,p;
    }city[MAX];
    double map[MAX][MAX];
    double dp[MAX][MAX];
    double sum;
    double dis[MAX];
    int pre[MAX];
    int t,n;
    int mark[MAX];
    void init()
    {
        memset(city,0,sizeof(city));
        for(int i=0;i<n;i++)
        {
            cin>>city[i].x>>city[i].y>>city[i].p;
        }
        for(int i=0;i<n;i++)
        {
            for(int j=i+1;j<n;j++)
            {
                map[i][j]=map[j][i]=sqrt(pow((city[i].x-city[j].x),2)+pow((city[i].y-city[j].y),2));
            }
        }
        for(int i=0;i<n;i++)map[i][i]=0;
    }
    double prime()
    {
        int now;
        double ans=0;
        memset(mark,0,sizeof(mark));
        memset(dp,0,sizeof(dp));
        for(int i=0;i<n;i++)
        {
            dis[i]=map[0][i];
            pre[i]=0;
        }
        mark[0]=1;
        for(int i=1;i<n;i++)
        {
            double temp=21000.0;
            for(int j=0;j<n;j++)
            {
                if(!mark[j]&&dis[j]<temp)
                {
                    temp=dis[j];
                    now=j;
                }
            }
            ans+=temp;
            mark[now]=1;
            for(int j=0;j<n;j++)
            {
                if(mark[j]&&j!=now)
                {
                    dp[j][now]=dp[now][j]=temp>dp[pre[now]][j]?temp:dp[pre[now]][j];
                }
            }
            for(int j=0;j<n;j++)
            {
                if(!mark[j])
                {
                    if(map[now][j]<dis[j])
                    {
                        dis[j]=map[now][j];
                        pre[j]=now;
                    }
                }
            }
        }
        return ans;
    }
    double answer()
    {
        double maxn=0.0;
        for(int i=0;i<n;i++)
        {
            for(int j=i+1;j<n;j++)
            {
                maxn=maxn>(city[i].p+city[j].p)*1.0/(sum-dp[i][j])?maxn:(city[i].p+city[j].p)*1.0/(sum-dp[i][j]);
            }
        }
        return maxn;
    }
    int main()
    {
        cin>>t;
        while(t--)
        {
            cin>>n;
            init();
            sum=prime();
            printf("%.2lf
    ",answer());
        }
    }
  • 相关阅读:
    NX CAM二次开发-UF_OPER_unload_path卸载刀路
    NX CAM二次开发-UF_PARAM_set_int_value不勾选侧面与底面余量一致
    NX CAM二次开发-UF_PARAM_set_subobj_ptr_value设置进给率
    NX CAM二次开发-UF_PARAM_set_double_value设置转数
    NX CAM二次开发-UF_NCGROUP_ask_object_of_name通过名称获得指定组(NCGroup)的TAG
    NX CAM二次开发-修改操作所属的刀具,几何体,程序组等
    VC++-OLE/COM将EXCEL导出PDF,ExcelBook.ExportAsFixedFormat
    VC++将PNG转成二进制文件,在将二进制文件转回PNG图片
    实例开发-NX二次开发批量设置体到图层工具
    NX-二次开发UFUN在面上创建等参数曲线UF_MODL_create_isocurve
  • 原文地址:https://www.cnblogs.com/lthb/p/4362697.html
Copyright © 2011-2022 走看看