hdu3833 YY's new problem--哈希表

最新推荐文章于 2022-02-25 20:00:37 发布

LaoJiu_

最新推荐文章于 2022-02-25 20:00:37 发布

阅读量716

点赞数 1

分类专栏：【数据结构】--哈希表文章标签：哈希 HDU C++ C 算法

本文链接：https://blog.csdn.net/LaoJiu_/article/details/51152400

版权

【数据结构】--哈希表专栏收录该内容

5 篇文章 0 订阅

订阅专栏

原题链接： http://acm.hdu.edu.cn/showproblem.php?pid=3833

一：原题内容

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

二：分析理解

好吧！再次感受到算法的强大。

把问题转化下就好。

P[i₁]-P[i₂]=P[i₂]-P[i₃]转化为P[i₁]+P[i₃]=2*P[i₂]

枚举i1和i3，和是偶数才可以继续判断，看代码。

三：AC代码

#include<iostream>    
#include<string.h>  
#include<algorithm>  
#include<cmath>

using namespace std;

#define N 10005

int a[N];
int hash1[N];
int T;
int n;

int main()
{
	scanf("%d", &T);
	while (T--)
	{
		scanf("%d", &n);
		for (int i = 0; i < n; i++)
		{
			scanf("%d", &a[i]);
			hash1[a[i]] = i;
		}

		int flag = 0;
		for (int i = 0; i <= n - 2; i++)
		{
			for (int j = i + 2; j <= n - 1; j++)
			{
				int s = a[i] + a[j];
				if (s % 2)
					continue;
				if (hash1[s / 2] > i&&hash1[s / 2] < j)
				{
					flag = 1;
					break;
				}
			}
			if (flag)
				break;
		}

		printf("%s\n", flag ? "Y" : "N");
	}
	
	return 0;
}