哈希运用

               
H - H
Time Limit:4000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Description

Given a permutation P of 1 to N, YY wants to know whether there exists such three elements P[i   1], P[i   2], P[i   3] that  
P[i   1]-P[i   2]=P[i   2]-P[i   3], 1<=i   1<i   2<i   3<=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   1, i   2, i   3  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 <string.h>
int hs[100000];
int ch[100000];         //再次强调数组大小问题,要开足
int main()
{
    int T,n,i,j,flag;
    scanf("%d",&T);
    while(T--)
    {
        memset(hs,0,sizeof(hs));
        flag=0;
        scanf("%d",&n);
        for(i=0; i<n; i++)
        {
            scanf("%d",&ch[i]);
            hs[ch[i]]=i;
        }
        for(i=0; i<n-2; i++)
            for(j=i+2; j<n; j++)
            {
                int a=ch[i]+ch[j];
                if(a%2!=0)                     //注意偶数的判断,如果是奇数就直接略过
                    continue;
                else
                {
                    if(hs[a/2]>i&&hs[a/2]<j)
                    {
                        flag=1;
                        break;
                    }
                }
            }
        if(flag)
            printf("Y\n");
        else
            printf("N\n");
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值