hdu 3833 YY's new problem

YY's new problem

Time Limit: 12000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 4061    Accepted Submission(s): 1143

Problem Description

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<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
#define M 10003
int hash[M];
int main ()
{
	int t,n,m,i,j;
	int flag;
	scanf("%d",&t);
	while(t--)
	{   
		flag=0;
		memset(hash,0,sizeof(hash));
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%d",&m);
			hash[m]=1; 
			if(flag==0)
			{
				for(j=1;j<m&&j<=n-m;j++)  // 写成 m-j>0 && m+j<=n 就易懂了。这样才能保证下面使用hash数组时不越界。
				{
					if(hash[m-j]+hash[m+j]==1)    // 两者只出现过一个
					{
						flag=1;
						break;
					}
				}
			}
		}
		if(flag) printf("Y\n");
		else printf("N\n");
	}
	return 0;
}