zoukankan      html  css  js  c++  java
  • HDU-4355-三分

    Party All the Time

    Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 5791    Accepted Submission(s): 1841


    Problem Description
    In the Dark forest, there is a Fairy kingdom where all the spirits will go together and Celebrate the harvest every year. But there is one thing you may not know that they hate walking so much that they would prefer to stay at home if they need to walk a long way.According to our observation,a spirit weighing W will increase its unhappyness for S3*W units if it walks a distance of S kilometers. 
    Now give you every spirit's weight and location,find the best place to celebrate the harvest which make the sum of unhappyness of every spirit the least.
     
    Input
    The first line of the input is the number T(T<=20), which is the number of cases followed. The first line of each case consists of one integer N(1<=N<=50000), indicating the number of spirits. Then comes N lines in the order that x[i]<=x[i+1] for all i(1<=i<N). The i-th line contains two real number : Xi,Wi, representing the location and the weight of the i-th spirit. ( |xi|<=106, 0<wi<15 )
     
    Output
    For each test case, please output a line which is "Case #X: Y", X means the number of the test case and Y means the minimum sum of unhappyness which is rounded to the nearest integer.
     
    Sample Input
    1 4 0.6 5 3.9 10 5.1 7 8.4 10
     
    Sample Output
    Case #1: 832
     
    Author
    Enterpaise@UESTC_Goldfinger
     
    Source
         求Y=Σw=Σ(wi*|xi-X|3) 使得Y达到最小的那个Ymin.
        注意到这个函数不是单调的,所以二分不可行,要用三分来做,mid=(l+r)/2,mid2=(mid+r)/2,然后f(x)较大的那个点作为新的l/r边界,慢慢缩小范围。
         
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 #define sf(a) scanf("%d",&a) 
     4 double x[50010],w[50010];
     5 int N;
     6 double cal(double X)
     7 {
     8     double r=0;
     9     for(int i=1;i<=N;++i){
    10         double t=fabs(X-x[i]);
    11         r+=w[i]*t*t*t;
    12     }
    13     return r;
    14 }
    15 int main()
    16 {
    17     int t,i,j,k;
    18     int cas=0;
    19     cin>>t;
    20     while(t--){
    21         cin>>N;
    22         for(i=1;i<=N;++i)
    23             scanf("%lf%lf",x+i,w+i);
    24         double l=-1000000,r=1000000;
    25         for(i=1;i<=200;++i){
    26             double mid=(l+r)/2;
    27             double mid2=(mid+r)/2;
    28             if(cal(mid)<cal(mid2)){
    29                 r=mid2;
    30             }
    31             else{
    32                 l=mid;
    33             }
    34         }
    35         printf("Case #%d: %.0f
    ",++cas,cal(l));
    36     }
    37     return 0;
    38 }
  • 相关阅读:
    转:UFLDL_Tutorial 笔记(deep learning绝佳的入门资料 )
    转:使用RNN解决NLP中序列标注问题的通用优化思路
    CTR预估中GBDT与LR融合方案
    ZOJ1157, POJ1087,UVA 753 A Plug for UNIX (最大流)
    Gentoo:startx出现Failed to load module问题
    HTTP请求和响应2:方法(Method)
    SharePoint 2013 表单认证使用ASP.Net配置工具加入用户
    理解支持向量机(四)LibSVM工具包的使用
    LeetCode 14: Longest Common Prefix
    精通Hibernate——域对象之间的关系
  • 原文地址:https://www.cnblogs.com/zzqc/p/8849943.html
Copyright © 2011-2022 走看看