总结二分法的用处:
1.二分法用于查找,查找已经排序完的数据。
2.二分法用于计算,例如求解方程的解可用二分法。
二分法:分为int型二分法,double型二分法
int型二分法:
int left = 0;int right = n -1
while (left <= right)
mid = (left + right) / 2
case
x[mid] < t: left = mid + 1;
x[mid] = t: p = mid; break;
x[mid] > t: right = mid -1;
return -1;
double型二分法:
const double esp=1e-4;
double low=0;
double high=Max(data)*Max(data);
double mid=0;
while((high-low)>esp)
{
mid=(low+high)/2;
count=0;//每次循环必须对count初始化
for(int i=1;i<=N;i++)
count+=(int)(data[i]*data[i])/(mid);
if(count<F)
high=mid;
else
if(count>F)
low=mid;
else
break;
}
#include<iostream>
#include<iomanip>
using namespace std;
#define PI 3.14159265359
const int MAX=10001;
const double esp=1e-4;
int N,F;
int Array[MAX];
int count;
inline int Max(int Array[])
{
int max=Array[1];
for(int i=2;i<=N;i++)
{
if(Array[i]>max)
max=Array[i];
}
return max;
}
double Cal(int data[])
{
double low=0;
double high=Max(data)*Max(data);
double mid=0;
while((high-low)>esp)
{
mid=(low+high)/2;
count=0;//每次循环必须对count初始化
for(int i=1;i<=N;i++)
count+=(int)(data[i]*data[i])/(mid);
if(count<F)
high=mid;
else
if(count>F)
low=mid;
else
break;
}
return mid;
}
int main()
{
int test;
scanf("%d",&test);
for(int i=1;i<=test;i++)
{
scanf("%d",&N);
scanf("%d",&F);
F++;
for(int i=1;i<=N;i++)
scanf("%d",&Array[i]);
double ans=Cal(Array);
cout<<fixed<<setprecision(4)<<ans*PI<<endl; //之前的计算都只是利用半径平方去计算,最后的结果要记得乘pi
}
}
解题指南见:
http://blog.csdn.net/lyy289065406/article/details/6648565
正确的二分查找模板
int search2(int array[], int n, int v)
{
int left, right, middle;
left = 0, right = n - 1;
while (left <= right)
{
middle = (left + right) / 2;
if (array[middle] > v)
{
right = middle - 1;
}
else if (array[middle] < v)
{
left = middle + 1;
}
else
{
return middle;
}
}
return -1;
}