POJ 3833 YY's new problem

最新推荐文章于 2021-02-23 22:55:58 发布

ACM2272902662

最新推荐文章于 2021-02-23 22:55:58 发布

阅读量1k

点赞数 1

分类专栏： HDU

本文链接：https://blog.csdn.net/yongxingao/article/details/13360757

版权

HDU 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

YY's new problem

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

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

Source

2011 Multi-University Training Contest 1 - Host by HNU

Recommend

xubiao | We have carefully selected several similar problems for you: 3835 3831 3834 3828 3830
没想到最后却是暴力暴过去的

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define N 10010
using namespace std;
struct num
{
    int l,r,sum;
}a[N*4];
int b[N],sum;
bool ch[N];
int main()
{
    //freopen("data.in","r",stdin);
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&b[i]);
        }
        memset(ch,false,sizeof(ch));
        ch[b[1]] = true;
        bool ans = false;
        for(int i=2;i<=n;i++)
        {
            int val = b[i];
            int r = val*2-1;
            if(r>n)
            {
                r = n;
            }
            int l = val*2 - r;
            if(l>r)
            {
                continue;
            }
            r = val-1;
            for(int j=l;j<=r;j++)
            {
                int val1 = j;
                int val2 = val*2-j;
                if((ch[val1]&&!ch[val2])||(!ch[val1]&&ch[val2]))
                {
                    ans = true;
                    break;
                }
            }
            if(ans)
            {
                break;
            }
            ch[b[i]] = true;
        }
        if(ans)
        {
            printf("Y\n");
        }else
        {
            printf("N\n");
        }
    }
    return 0;
}