ACM - Expanding Rods

最新推荐文章于 2024-11-08 15:01:00 发布

Black_xtree

最新推荐文章于 2024-11-08 15:01:00 发布

阅读量143

点赞数

分类专栏：二分三分法文章标签： c++ 算法

原文链接：https://blog.csdn.net/Wen_Yongqi/article/details/86507652

版权

二分三分法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Expanding Rods

*When a thin rod of length L is heated n degrees, it expands to a new length L’=(1+n*C)L, where C is the coefficient of heat expansion.When a thin rod is mounted on two solid walls and then heated, it expands and takes the shape of a circular segment, the original rod being the chord of the segment.Your task is to compute the distance by which the center of the rod is displaced.
在这里插入图片描述

Input
The input contains multiple lines. Each line of input contains three non-negative numbers: the initial lenth of the rod in millimeters, the temperature change in degrees and the coefficient of heat expansion of the material. Input data guarantee that no rod expands by more than one half of its original length. The last line of input contains three negative numbers and it should not be processed.

Output
For each line of input, output one line with the displacement of the center of the rod in millimeters with 3 digits of precision.

Sample Input
1000 100 0.0001
15000 10 0.00006
10 0 0.001
-1 -1 -1

Sample Output
61.329
225.020
0.000

二分答案：
答案确定了精度，可以二分答案。在运算过程中从答案入手，即从m入手，反向确定L’。
二分答案特征：
1.有最大值最小值区间。
2.二分过程存在单调性，并利用单调性。
3.求最大值的最小，或求最小值的最大。
对此题如果直接利用几何关系运算会比较麻烦，但m与L’存在单调性。（物理直觉上感知）故利用单调性二分答案。
在这里插入图片描述
代码：

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<stack>
#include<cstring>
#include<cstdio>
#include<list>
#include<map>
#include<cmath>
using namespace std;

double l, n;
double c, l_, l2;
double L, R, m;

int main()
{
	while (cin >> l >> n >> c)
	{
		if (l < 0 && n < 0 && c < 0)break;
		L = 0;
		R = l / 2;
		l_ = (1 + n * c) * l;
		while (R - L > 1e-5)
		{
			m = (L + R) / 2;
			double r = m / 2 + l * l / m / 8;
			l2 = 2 * r * asin(l / r / 2);
			if (l2 < l_) L = m;  // 利用单调性，说明此m小了
			else R = m;
		}
		printf("%.3f\n", L);
	}
	return 0;
}