哈希算法---YY's new problem

Given a permutation P of 1 to N, YY wants to know whether there exists such three elements P[i  ₁], P[i  ₂], P[i  ₃] that 
P[i  ₁]-P[i  ₂]=P[i  ₂]-P[i  ₃], 1<=i  ₁<i  ₂<i  ₃<=N.

Input

The first line is T(T<=60), representing the total test cases. 
Each test case comes two lines, the former one is N, 3<=N<=10000, the latter is a permutation of 1 to N.

Output

For each test case, just output 'Y' if such i  ₁, i  ₂, i  ₃ can be found, else 'N'.

Sample Input

2
3
1 3 2
4
3 2 4 1

Sample Output

N
Y

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int num[10007];
int Hash[10007];
int main()
{
	int T,N;
	int sum,flag;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&N);
		memset(num,0,sizeof(num));
		memset(Hash,0,sizeof(Hash));
		flag=0;
		for(int i=0;i<N;i++)
		{
			scanf("%d",&num[i]);
			Hash[num[i]]=i;		//根据数据出现的先后次序来 标记 
		}
		for(int i=0;i<N;i++)
		{
			for(int j=i+1;j<N;j++)
			{
				sum=num[i]+num[j];
				if(sum%2) continue;
				else if(Hash[sum/2]>i&&Hash[sum/2]<j)
				{ 
					flag=1;
					break;
				}
			}
			if(flag==1)
				break;
		}
		if(flag==1)	printf("Y\n");
		else printf("N\n");
	}
	return 0;
 } 

Time limit

4000 ms

Memory limit

65536 kB

OS

Windows

Status	Accepted
Time	3104ms
Memory	1640kB
Length	648
Lang	G++
Submitted	2017-04-11 20:31:29