三分法求极值
来源:互联网 发布:手机淘宝旺信在哪里 编辑:程序博客网 时间:2024/05/01 05:36
三分求解凹凸函数的极值问题。
Party All the Time
2000ms
32768KB
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.
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
140.6 53.9 105.1 78.4 10
Sample Output
Case #1: 832
#include<stdio.h>#include<math.h>const double eps=1e-4;double x[50001],w[50001]; int N;double tri(double x){ return x*x*x;}double cal(double h){ double res=0.00000;int i; for(i=1;i<=N;i++) { res+=tri(fabs(x[i]-h))*w[i]; } return res;}int main(){ int T,i; double left,right,mid,midmid; int Ca=1; scanf("%d",&T); while(T--) { scanf("%d",&N); for(i=1;i<=N;i++) scanf("%lf%lf",x+i,w+i); left=-1e6; right=1e6; while(fabs(left-right)>eps) { mid=(left+right)/2; midmid=(mid+right)/2; if(cal(mid)<cal(midmid)) right=midmid; else left=mid; } printf("Case #%d: %.0lf\n",Ca,cal(left)); Ca++; } return 0;}
- 三分法求极值
- 三分法求极值
- poj3737UmBasketella三分法求极值
- poj3737UmBasketella三分法求极值
- 三分法求极值
- 算法-三分法求极值
- 关于三分法求函数极值
- HDU 3756 三分法求极值
- hihocoder 1142 三分法求极值
- 三分法求单峰函数极值
- 三分法求函数最大值(求导求极值)
- 和菜鸟一起学算法之三分法求极值问题
- poj 3301 Texas Trip 三分法求旋转角极值
- POJ 3301 Texas Trip 计算几何 三分法求极值点
- hdu 5105 求函数极值 函数求导/三分法
- 【算法设计与数据结构】三分法:求单峰函数的极值
- 三分法——凸函数求极值问题
- HDU 3714基础的三分法求函数极值
- 会不会写makefile, 从一个侧面说明了一个人是否具备完成大型工程的能力
- 全文搜索工具regain学习笔记--配置文件
- Linux下后缀名为ko、o、a、so、la的文件简述
- android中界面显示结构
- JavaScript调试方法
- 三分法求极值
- 【Div+CSS笔记】 0x01 html常用标签元素
- 电容屏驱动开发(一) 工作原理,资料收集(未完)
- HDU1829(A Bug's Life )—并查集
- android中的图片的每个点旋转矩阵
- Window_Open详解
- vc下DLL/lib的调用
- SqlServer文件和文件组的用途
- hdu 1176-DP