UVA - 11898 Killer Problem

最新推荐文章于 2019-08-22 23:27:39 发布

Joyyiwei

最新推荐文章于 2019-08-22 23:27:39 发布

阅读量927

点赞数

分类专栏：高效算法

本文链接：https://blog.csdn.net/u011345136/article/details/38488943

版权

高效算法专栏收录该内容

97 篇文章 0 订阅

订阅专栏

Description

Killer Problem

You are given an array of N integers and Q queries. Each query is a closed interval [l, r]. You should find the minimum absolute difference between all pairs in that interval.

Input

First line contains an integer T ( T $\le$ 10). T sets follow. Each set begins with an integer N ( N $\le$ 200000). In the next line there are N integers a_i ( 1 $\le$ a_i $\le$ 10⁴), the number in the i-th cell of the array. Next line will contain Q ( Q $\le$ 10⁴). Q lines follow, each containing two integers l_i, r_i ( 1 $\le$ l_i, r_i $\le$ N, l_i < r_i) describing the beginning and ending of of i-th range. Total number of queries will be less than 15000.

Output

For the i-th query of each test output the minimum | a_j–a_k| for l_i $\le$ j, k $\le$ r_i ( j $\ne$ k) a single line.

Sample Input

1
10
1 2 4 7 11 10 8 5 1 10000
4
1 10
1 2
3 5
8 10

Sample Output

题意：给定一个整数数组，对每组的询问L，R，输出区间差最小是多少

思路：排序后处理，但是这样会超时，因为题目说和不超过15000，所以最差也就只有15000个数

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;
const int maxn = 200005;
const int inf = 0x3f3f3f3f;

int num[maxn];
int tmp[maxn];
int n, q;

void cal(int l, int r) {
	if (r - l + 1 > 15000) {
		printf("0\n");
		return;
	}
	int cnt = 0;
	for (int i = l; i <= r; i++)
		tmp[cnt++] = num[i];
	sort(tmp, tmp+cnt);
	int Min = inf;
	for (int i = 0; i < cnt-1; i++)
		Min = min(Min, tmp[i+1]-tmp[i]);
	printf("%d\n", Min);
}

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		scanf("%d", &n);
		for (int i = 1; i <= n; i++)
			scanf("%d", &num[i]);
		scanf("%d", &q);
		int l, r;
		while (q--) {		
			scanf("%d%d", &l, &r);
			cal(l, r);
		}
	}
	return 0;
}