> 我的程序如下：
#include <cstdio>
inline long *partion(long *s,long *e)
{
	long *p=s;
	for(long *x=s+1;x<e;x++)
		if(*x<=*s&&++p!=x)
		{
			long temp=*x;
			*x=*p;
			*p=temp;
		}
	long temp=*s;
	*s=*p;
	*p=temp;
	return p;
}
long f(long *s,long *e,long *key)
{

	long *x=e-1;
	while(x!=key)
	{
		if(x>key)x=partion(s,x);
		else x=partion(x+1,e);
	}
	return *x;
}
int main()
{
	long n,m;
	scanf("%d%d",&n,&m);
	long *a=new long[n],*p=a;
	while(n--)scanf("%d",p++);
	while(m--)
	{
		int i,j,k;
		scanf("%d%d%d",&i,&j,&k);
		int N=j-i+1;
		long *b=new long[N],*q=b;
		p=a+i-1;
		while(N--)*(q++)=*(p++);
		printf("%d\n",f(b,q,b+k-1));
		delete []b;
	}
	delete []a;
	return 0;
}

• 这样会超时 (801) frkstyc 2005-05-18 21:40:08
  • Re我试过啊.没有超时.就是Wrong Answer. (0) bird 2005-05-18 21:57:25
    • 就算程序是对的，这种做法会超时。但是现在你的程序还没对。 (0) hawk 2005-05-18 22:05:28
      • hawk has much patience! (0) frkstyc 2005-05-18 22:08:09