2-1众数问题

2-1众数问题

#include<iostream>
#include<algorithm> 
int repetion=0;
int median=0;
using namespace std;
void find_mode(int a[],int left,int right,int &repetion,int &median,int n){
	if(left>right){
		return;
	}
	sort(a,a+n-1);//使得数组从小到大排序
	int mid=(n-1)/2;
	int mode=a[mid];//设中位数作为第一次的众数
	int temp1=mid-1,temp2=mid+1;
	while(temp1>=0&&a[temp1]==a[mid]){
		temp1--;
	} 
	while(temp2<=n-1&&a[temp2]==a[mid]){
		temp2++;
	}
	if(temp2-temp1-1>repetion){//记录众数出现的次数 
	    repetion=temp2-temp1-1;
	    median=mode;
	    
    } 
	if(temp1-right-1>repetion){
		find_mode(a,right,temp1,repetion,median,n);
	}
	if(right-temp2+1>repetion){
		find_mode(a,temp2,left,repetion,median,n);
	}
}
int main(){
	int n;//要输入几个元素
	cin>>n;
	int a[n];//要输入的元素存储 
	for(int i=0;i<n;i++){
		cin>>a[i];
	} 
	find_mode(a,0,n-1,repetion,median,n);
	cout<<median<<endl;
	cout<<repetion<<endl;
	return 0;
}