hdu 4355 Party All the Time 三分

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
2012 Multi-University Training Contest 6

设该点坐标为x,,sum=(fab(x-x1))^3*w+(fab(x-x2))^3*w+(fab(x-x3))^3*w+…+(fab(x-xn))^3*w
对这个式子进行2次求导有..6(fab(x-xi))+1..恒大于0,,因此不满意度呈凹性。所以用3分。。
注意0.f已经四舍五入了。。不需要所谓的 rounded to the nearest integer.了。。(被坑一次)
fab(x)要耗时。。提出来。。。(少用)

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#define EPS 1e-5
using namespace std;
int n;
double a[50005];
double s[50005];

double man(double x)
{
    double sum=0.0;
    for(int i=1;i<=n;i++)
    {
        double t=fabs(x-a[i]);
        sum+=s[i]*t*t*t;
    }
    return sum;
}
int main()
{
    int T;
    scanf("%d",&T);
    for(int t=1;t<=T;t++)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++) scanf("%lf %lf",&a[i],&s[i]);
        double l=a[0];
        double r=a[n];
        while(r-l>=EPS)
        {
            double d1=l+(r-l)/3.0;
            double d2=r-(r-l)/3.0;
            if(man(d1)<man(d2)) r=d2;
            else l=d1;
        }
       printf("Case #%d: %.0f\n",t,man(l+(r-l)/3.0));
    }
    return 0;
}

资源下载链接为: https://pan.quark.cn/s/22ca96b7bd39 在当今的软件开发领域,自动化构建与发布是提升开发效率和项目质量的关键环节。Jenkins Pipeline作为一种强大的自动化工具,能够有效助力Java项目的快速构建、测试及部署。本文将详细介绍如何利用Jenkins Pipeline实现Java项目的自动化构建与发布。 Jenkins Pipeline简介 Jenkins Pipeline是运行在Jenkins上的一套工作流框架,它将原本分散在单个或多个节点上独立运行的任务串联起来,实现复杂流程的编排与可视化。它是Jenkins 2.X的核心特性之一,推动了Jenkins从持续集成(CI)向持续交付(CD)及DevOps的转变。 创建Pipeline项目 要使用Jenkins Pipeline自动化构建发布Java项目,首先需要创建Pipeline项目。具体步骤如下: 登录Jenkins,点击“新建项”,选择“Pipeline”。 输入项目名称和描述,点击“确定”。 在Pipeline脚本中定义项目字典、发版脚本和预发布脚本。 编写Pipeline脚本 Pipeline脚本是Jenkins Pipeline的核心,用于定义自动化构建和发布的流程。以下是一个简单的Pipeline脚本示例: 在上述脚本中,定义了四个阶段:Checkout、Build、Push package和Deploy/Rollback。每个阶段都可以根据实际需求进行配置和调整。 通过Jenkins Pipeline自动化构建发布Java项目,可以显著提升开发效率和项目质量。借助Pipeline,我们能够轻松实现自动化构建、测试和部署,从而提高项目的整体质量和可靠性。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值