light oj 【数论】1297 - Largest Box【三分】

1297 - Largest Box

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

In the following figure you can see a rectangular card. The width of the card is W and length of the card is L and thickness is zero. Four (x*x) squares are cut from the four corners of the card shown by the black dotted lines. Then the card is folded along the magenta lines to make a box without a cover.

Given the width and height of the box, you will have to find the maximum volume of the box you can make for any value of x.

Input

Input starts with an integer T (≤ 10000), denoting the number of test cases.

Each case starts with a line containing two real numbers L and W (0 < L, W < 100).

Output

For each case, print the case number and the maximum volume of the box that can be made. Errors less than 10^-6 will be ignored.

Sample Input	Output for Sample Input
3 2 10 3.590 2.719 8.1991 7.189	Case 1: 4.513804324 Case 2: 2.2268848896 Case 3: 33.412886

分析：

数学题，对三元一次方程求导，导函数等于0，就是函数上升的最大值。

代码：

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;


int main()
{
	int t;
	scanf("%d",&t);
	int cnt=0;
	while(t--)
	{
		double l,w;
		scanf("%lf%lf",&l,&w);
		double a=12;
		double b=-4*(w+l);
		double c=w*l;
		double x=(-b-sqrt(b*b-4*a*c))/2/a;
		double ans;
		ans=(w-2*x)*(l-2*x)*x;
		printf("Case %d: ",++cnt);
		printf("%.7lf\n",ans);
	}
	return 0;
} 

代码L：【三分】

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
#define mem(x,y) memset(x,y,sizeof(x));

double l,w;

double solve(double e)
{
	return (w-2*e)*(l-2*e)*e;
}

double sf(double l,double r)
{
	double mid,mm;
	while(r-l>1e-10)
	{
		mid=(l+r)/2;
		mm=(mid+r)/2;
		if(solve(mid)>=solve(mm))
		r=mm;
		else l=mid;
	}
	return mid;
}
int main()
{
	int t;
	int cnt=0;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lf%lf",&l,&w);
		double x=sf(0,min(l,w)/2);
		double pyl=solve(x);
		printf("Case #%d: %.7lf\n",++cnt,pyl);
	}
	return 0;
}