利用分治法解决假硬币问题（C++）

#include<iostream>
using namespace std;
int sum(int a[],int left,int right)
{
    int sum=0;
    for(int i=left;i<=right;i++)  sum+=a[i];
    return sum;
}
int FindCorn(int a[], int left, int right)
{
    int sum1,sum2;
    sum1=sum2=0;
    if(left+1==right)   //偶数个硬币只剩下两枚，无法进行分组，可直接进行比较
	{
        if(a[left]<a[right]) return left+1;
        else return right+1;
    }
    if(left==right)   //当硬币分组组前是三个硬币，分组后只剩下一个，即为假硬币
        return left+1;
    if((right-left+1)%2==0)   //当硬币数量为偶数个时
	{
        sum1=sum(a,left,left+(right-left)/2);   //将数组平均分为左右两组
        sum2=sum(a,left+(right-left)/2+1,right);
        /*cout<<"left"<<left<<"\n"; //该部分可以观察左右指针的移动，便于调试
        cout<<"right"<<right<<"\n";*/
        if(sum1>sum2) return FindCorn(a, left+(right-left)/2+1, right);          
//如果左组重量总和偏低，则假硬币在左组，反之亦然
        else if(sum1<sum2) return FindCorn(a, left, left+(right-left)/2);
    }
    else                                                 //数组长度为奇数，仅比较数组中间值两端的总和，若两端相等则中间为假硬币
	{
        sum1=sum(a,left,left+(right-left)/2-1);
        sum2=sum(a,left+(right-left)/2+1,right);
       /* cout<<"left"<<left<<"\n";
        cout<<"right"<<right<<"\n";*/
        if(sum1>sum2) return FindCorn(a ,left+(right-left)/2+1, right);
        if(sum1<sum2) return FindCorn(a,left,left+(right-left)/2-1);
        if(sum1 == sum2) return left+(right-left)/2+1;
    }
}
int main()
{
    int a[100];
	int n;
	cout << "请输入硬币的个数" << endl;
	cin >> n;
	cout << "请一个一个输入这些硬币的重量" << endl;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	cout << "假币是第" << FindCorn(a,0,n-1) << "个硬币";
    return 0;
}