hdu3833YY's new problem

最新推荐文章于 2024-07-25 16:30:00 发布

MissZhou要努力

最新推荐文章于 2024-07-25 16:30:00 发布

阅读量459

点赞数

CC 4.0 BY-SA版权

分类专栏： ———哈希表

本文链接：https://blog.youkuaiyun.com/zhou_yujia/article/details/46582113

———哈希表专栏收录该内容

3 篇文章

订阅专栏

这个题又是想难了，联想到poj2549 看了题解自己写WA了好多次 ==其实之前犯过这个错误T^T 跳出循环时要注意题中给的数得读入结束才行长点心吧。。。

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

Sample Output

N
Y

#include <iostream>
#include<cstdio>
#include<cstring>
//#include<algorithm>
#define mm 10003
using namespace std;
int t,n,s,flag;
int hsh[mm];
int main()
{
   // freopen("cin.txt","r",stdin);
    cin>>t;
    while(t--)
    {
         cin>>n;
         memset(hsh,0,sizeof(hsh));
         flag=0;
         for(int i=0;i<n;i++)
         {
              scanf("%d",&s);
              hsh[s]=1;
              if(flag==0)
              {
              for(int j=1;j<s&&j+s<=n;j++)
              {
                   if(hsh[s+j]+hsh[s-j]==1)
                   {
                        flag=1;
                        break;
                   }
              }                   
              }

              //if(flag) break;//就是这里 如果这么就跳出来了 会有数没读完
         }
         if(flag) cout<<"Y"<<endl;
         else cout<<"N"<<endl;
    }
    return 0;
}