YY‘s new problem

Time Limit: 12000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 3501    Accepted Submission(s): 984

2
3
1 3 2
4
3 2 4 1

N
Y

#include"stdio.h"
#include"string.h"
#define N 10005
int main()
{
	int T,t,n,i,m,flag,hash[N];
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		memset(hash,0,sizeof(hash));
		m=n;
		flag=0;
		while(m--)
		{
			scanf("%d",&t);
			hash[t]=1;
			for(i=1;!flag&&i<t&&t+i<=n;i++) 
			{
				if(hash[t-i]+hash[t+i]==1) //这两个元素有且只有一个出现
					flag=1;
			}
		}
		if(flag)
			printf("Y\n");
		else
			printf("N\n");
	}
	return 0;
}

hdu 3833 YY's new problem,布布扣,bubuko.com

hdu 3833 YY's new problem

原文：http://blog.csdn.net/u011721440/article/details/21037251