cpp1.cpp

分治策略求最值,是算法设计与分析书的源码改进版。

#include<iostream.h>
double f(int x,int y,double a[])//求a[x]到a[y]的最大值
{
	if(x==y) return a[x];
	else
	{
		double m=f(x,(x+y)/2,a)>f((x+y)/2+1,y,a)?f(x,(x+y)/2,a):f((x+y)/2+1,y,a);
		return m;
	}
}
void main()
{
	int n;
	cout<<"input the number of data   ";
	cin>>n;
	double *a=new double[n];
    cout<<"input the value of data   ";
    for(int i=0;i<n;i++)
	{
		cin>>a[i];
	}
	cout<<"the max of the data is "<<f(0,n-1,a)<<endl;
}