[UVA][假解] 11898 - 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 (T1...