Killer Problem

點擊打開鏈接

題意：t組測試用例，n個數,q組查詢，查詢區間[l,r]輸出[l,r]中任意兩個數絕對值之差的最小的。

暴力

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
int t,l,r,n,q,a[200005],cnt[100005];
int query(int l,int r)
{int k,i,minn;if(r-l+1>10000)return 0;else{k=0;for(i=l;i<=r;i++)cnt[k++]=a[i];sort(cnt,cnt+k);minn=inf;for(i=0;i<k-1;i++)minn=min(minn,abs(cnt[i+1]-cnt[i]));return minn;}
}
int main()
{int ans,i;scanf("%d",&t);while(t--){scanf("%d",&n);for(i=1;i<=n;i++)scanf("%d",&a[i]);scanf("%d",&q);while(q--){scanf("%d%d",&l,&r);ans=query(l,r);printf("%d\n",ans);}}
}