ACM-ICPC基本算法之分治法

字面解释就是“分而治之”，就是把一个复杂的问题分成两个或者更多个相同或相似的子问题，再把子问题分成更小的子问题，直到最后子问题可以简单地直接求解！

#include <iostream>
using namespace std;
int binsearch(int R[],int N,int key)
{
	int low,high,mid;
	low = 1;
	high = N;
	mid = (low+high)/2;
	while(low<high)
	{
		if(key==R[mid])
			return mid;
		else if(key<R[mid])
				high = mid - 1;
		else
			low = mid + 1;
		mid = (low+high)/2;
	}
	return mid;
}
int main()
{
	int i,n,key,index;
	int a[1001];
	cin >> n;
	for(i=1;i<=n;i++)
		cin >> a[i];
	cin >> key;
	index = binsearch(a,n,key);
	cout << index << endl;
	return 0;
}

#include <iostream>
using namespace std;
int w[100001];
int gold(int low,int high,int *max,int *min)
{
	int x1,x2,y1,y2;
	int mid;
	if(low==high)
		*max = *min = w[low];
	else if((high-low)==1){
			if(w[high]>w[low])
			{
				*max = w[high];
				*min = w[low];
			}
			else
			{
				*max = w[low];
				*min = w[high];
			}
	}
	else
	{
		mid = (low+high)/2;
		gold(low,mid,&x1,&y1);
		gold(mid+1,high,&x2,&y2);
		*max = (x1>x2)?x1:x2;
		*min = (y1<y2)?y1:y2;
	}
	return 0;
}
int main()
{
	int m,i;
	int max,min;
	cin >> m;
	for(i=1;i<=m;i++)
		cin >> w[i];
	gold(1,m,&max,&min);
	cout << max << " " << min;
	return 0;
}

#include <iostream>
#define MAX 100
using namespace std;
int is1[MAX],is2[MAX];
int merge(int low,int mid,int high)
{
	int i=low,j=mid+1,k=low;
	while(i<=mid && j<=high)
		if(is1[i]<=is1[j])
			is2[k++]=is1[i++];
		else
			is2[k++]=is1[j++];
	while(i<=mid)
		is2[k++]=is1[i++];
	while(j<=high)
		is2[k++]=is1[j++];
	for(i=low;i<=high;i++)
		is1[i]=is2[i];
	return 0;
}
int mergeSort(int a,int b)
{
	if(a<b)
	{
		int mid = (a+b)/2;
		mergeSort(a,mid);
		mergeSort(mid+1,b);
		merge(a,mid,b);
	}
	return 0;
}
int main()
{
	int i,n;
	cin >> n;
	for(i=1;i<=n;i++)
		cin >> is1[i];
	mergeSort(1,n);
	for(i=1;i<=n;i++)
		cout << is1[i] << " ";
	cout << endl;
	return 0;
}

#include <iostream>
#include <string.h>
using namespace std;
int multi(char s1[],char s2[],int a[])
{
	long b,d;
	int i,i1,i2,j,k,n,n1,n2;
	for(i=0;i<255;i++)
		a[i] = 0;
	n1 = strlen(s1);
	n2 = strlen(s2);
	d = 0;
	for(i1=0,k=n1-1;i1<n1;i1++,k--)
	{
		for(i2=0,j=n2-1;i2<n2;i2++,j--)
		{
			i = i1+i2;
			b = a[i]+(s1[k]-48)*(s2[j]-48)+d;
			a[i]=b%10;
			d = b/10;
		}
		while(d>0){
			i++;
			a[i]+=d%10;
			d/=10;		
		}
		n = i;
	}
	return n;
}
int main()
{
	int i,m,x[1001];
	char s1[1001],s2[1001];
	gets(s1);
	gets(s2);
	m = multi(s1,s2,x);
	for(i=m;i>=0;i--)
		cout << x[i];
	cout << endl;
	return 0;
}

#include <iostream>
#include <algorithm>
#define max 100
using namespace std;
typedef char datatype;
typedef struct node
{
	datatype data;
	struct node *lchild,*rchild;
}bitree;
bitree *creat_tree()
{
	bitree *t;
	char ch;
	scanf("%c",&ch);
	if(ch == '@')
		t = NULL;
	else
	{
		t = (struct node *)malloc(sizeof(bitree));
		t->data = ch;
		t->lchild = creat_tree();
		t->rchild = creat_tree();
	}
	return t;
}
int preorder(bitree *t)
{
	if(t)
	{
		printf("%c",t->data);
		preorder(t->lchild);
		preorder(t->rchild);
	}
	return 0;
}
int inorder(bitree *t)
{
	if(t)
	{
		inorder(t->lchild);
		printf("%c",t->data);
		inorder(t->rchild);
	}
	return 0;
}
int postorder(bitree *t)
{
	if(t)
	{
		postorder(t->lchild);
		postorder(t->rchild);
		printf("%c",t->data);
	}
	return 0;
}
int main()
{
	bitree *tree;
	tree = creat_tree();
	preorder(tree);
	cout << endl;
	inorder(tree);
	cout << endl;
	postorder(tree);
	cout << endl;
	return 0;
}