Killer Problem

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 (T10). T sets follow. Each set begins with an integer N (N200000). In the next line there are N integers ai (1ai104), the number in the i-th cell of the array. Next line will contain Q (Q104). Q lines follow, each containing two integers li, ri (1li, riN, li < ri) 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 | aj–ak| for lij, kri (jk) 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

0
1
3
4

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

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

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=200005;
const int N=0x3f3f3f3f;
int a[maxn];
int b[maxn];
void st(int x,int y)
{
    if(y-x+1>15000)
    {
        printf("0\n");
        return;
    }
    int k=0;
    for(int i=x; i<=y; i++)
    {
        b[k++]=a[i];
    }
    sort(b,b+k);
    int sum=N;
    for(int i=0; i<k-1; i++)
    {
        sum=min(sum,b[i+1]-b[i]);
    }
    printf("%d\n",sum);
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,i,x,y;
        scanf("%d",&n);
        for(i=1; i<=n; i++)
            scanf("%d",&a[i]);
        int m;
        scanf("%d",&m);
        while(m--)
        {
            scanf("%d%d",&x,&y);
            st(x,y);
        }
    }
    return 0;
}