dalao帮忙康康,为甚我用归并排序就错了,哎(为什么题解就对了)
查看原帖
dalao帮忙康康,为甚我用归并排序就错了,哎(为什么题解就对了)
88339
罗小黑小鱼楼主2020/8/18 11:35
#include<bits/stdc++.h>
using namespace std;
int n,r,q;
struct player{
	int score,ab,num;
}a[202020],p[202020];
inline int read(){
	char ch;
	int x=0,f=1;
	for(ch=getchar();!isdigit(ch)&&ch!='-';ch=getchar());
	if(ch=='-'){
		f=-1;
		ch=getchar();
	}
	for(;isdigit(ch);ch=getchar()) x=(x<<1)+(x<<3)+(ch^48);
	return x*f; 
}
void ertoyi(int q,int z,int h)//相当于merge(合并,即并){
	int k=q;
	int i=q;
	int j=z+1;
	while(i<=z&&j<=h)
	    if(a[i].score<a[j].score){
			p[k].score=a[j].score;
			p[k].num=a[j].num;
			p[k].ab=a[j++].ab;
			k++;
	    }
	    else{
	    	if(a[i].score==a[j].score){
	    		if(a[i].num<a[j].num){
	    			p[k].score=a[i].score;
					p[k].num=a[i].num;
					p[k].ab=a[i++].ab;
					k++;
	    		}
	    		else{
	    			p[k].score=a[j].score;
					p[k].num=a[j].num;
					p[k].ab=a[j++].ab;
					k++;
	    		}
	    	}
	    	else{
		    	p[k].score=a[i].score;
				p[k].num=a[i].num;
				p[k].ab=a[i++].ab;
				k++;
	    	}
	    	
	    }
	while(i<=z){
		p[k].score=a[i].score;
		p[k].num=a[i].num;
		p[k].ab=a[i++].ab;
		k++;
	}
	while(j<=h){
		p[k].score=a[j].score;
		p[k].num=a[j].num;
		p[k].ab=a[j++].ab;
		k++;
	}
	for(int i=q;i<=h;i++){
		a[i].score=p[i].score;
		a[i].ab=p[i].ab;
		a[i].num=p[i].num;
	}
}
void together(int s,int t)//相当于归{
	if(s<t){
		int mid=(s+t)/2;
		together(s,mid);
		together(mid+1,t);
		ertoyi(s,mid,t);
	}
}
int main(){
	//freopen("1.in","r",stdin);
	cin.tie(0);
	ios::sync_with_stdio(false);
	n=read();
	r=read();
	q=read();
	for(int i=1;i<=2*n;i++){
		a[i].score=read();
	}
	for(int i=1;i<=2*n;i++){
		a[i].ab=read();
		a[i].num=i;
	}
	for(int i=1;i<=r;i++){
		together(1,2*n);
		for(int j=1;j<=2*n;j+=2){
			if(a[j].ab>a[j+1].ab) a[j].score++;
			else a[j+1].score++;
		}
	}
	together(1,2*n);
	cout<<a[q].num<<endl;
	return 0;
}
2020/8/18 11:35
加载中...