三分算法
用于计算单峰函数求极值
Party All the Time HDU - 4355 浮点数三分算法
模板
//浮点三分
const double EPS = 1e-9;
while(r - l > EPS) {
double lmid = l + (r - l) / 3;
double rmid = r - (r - l) / 3;
lans = f(lmid),rans = f(rmid);
// 求凹函数的极小值
if(lans <= rans) r = rmid;
else l = lmid;
// 求凸函数的极大值
if(lans >= rans) l = lmid;
else r = rmid;
}
// 输出 l 或 r 都可
cout << l << endl;
AC代码
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
const double EPS=1e-5;
const int maxn=5e4+100;
int n;
struct node
{
double weizhi,weight;
}a[maxn];
inline double trible(double x)
{
return x*x*x;