三分模板
简介:
- 二分查找适用于单调函数中逼近求解某点的值。
- 如果遇到凸性或凹形函数时,可以用三分查找求此凸点或凹点。
三分图解:
两种模板:
均为找上凸点(找下凹点将大于改为小于即可)
- 法一:
double f(double a){/*根据题目意思计算*/}
{
}
double three(double l,double r) //找凸点
{
while(l<r-1)
{
double mid=(l+r)/2;
double mmid=(mid+r)/2;
if(f(mid)>f(mmid)) r=mmid;
else l=mid;
}
if(f(l)>f(r)) return l;
else return r;
}
- 法二
const int eps = 1e-9
double f(double a){/*根据题目意思计算*/}
{
}
double three(double l,double r) // 找凸点
{
while(fabs(l - r) > eps)
{
double mid=l+(r-l)/3;
double midmid=r-(r-l)/3;
if(f(mid)>f(midmid)) r=midmid; // 找凹点变为 < 即可
else l=mid;
}
return l;
}
曲线
思路:
三分找下凹点
代码如下:
#include <bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(nullptr); cout.tie(nullptr)
#define x first
#define y second
#define int long long
using namespace std;
typedef pair<int, int> PII;
const int N = 5e5 + 10, M = 1010, INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-9;
int n, m1, m2;
double a[N], b[N], c[N];
double f(double x)
{
double res = -INF;
for (int i = 1; i <= n; i ++ )
res = max(res, a[i] * x * x + b[i] * x + c[i]);
return res;
}
void solve()
{
cin >> n;
for (int i = 1; i <= n; i ++ )
cin >> a[i] >> b[i] >> c[i];
double l = 0, r = 1000;
while(fabs(r - l) > eps)
{
double lm = l + (r - l) / 3;
double rm = r - (r - l) / 3;
if(f(lm) < f(rm)) r = rm;
else l = lm;
}
printf("%.4f\n", f(l));
return;
}
signed main()
{
//fast;
int T = 1;
cin >> T;
while(T -- )
solve();
return 0;
}
灯泡
思路:
三分找上凸点
代码如下:
#include <bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(nullptr); cout.tie(nullptr)
#define x first
#define y second
#define int long long
using namespace std;
typedef pair<int, int> PII;
const int N = 5e5 + 10, M = 1010, INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-9;
double H, h, D;
double f(double mid)
{
double k = (H - h) / (mid - D);
double b = H + D * k;
if(b >= 0) return b + mid;
else return mid - b / k;
}
void solve()
{
cin >> H >> h >> D;
double l = 0, r = D;
while(fabs(r - l) > eps)
{
double lm = l + (r - l) / 3;
double rm = r - (r - l) / 3;
if(f(lm) > f(rm)) r = rm;
else l = lm;
}
printf("%.3lf\n", f(l));
return;
}
signed main()
{
//fast;
int T = 1;
cin >> T;
while(T -- )
solve();
return 0;
}