Balanced Lineup Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 39453 Accepted: 18511Case Time Limit: 2000MS Description For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000)

Balanced Lineup Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 38054 Accepted: 17819Case Time Limit: 2000MS Description For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000)

Balanced Lineup Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 33665 Accepted: 15830Case Time Limit: 2000MS Description For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000)

题目大意：给出一串数字，然后给出一个区间a b，输出从a到b的最大的数和最小的数的差。 N(1 ≤ N ≤ 50000), Q(1 ≤ Q ≤ 200000)；N为数字个数，1 ≤每个数 ≤ 1,000,000。。。如： 输入： 6 3 1 7 3 4 2 5 1 5 4 6 2 2 输出： 6 3 0 解题方法：用线段树和稀疏表均可以做。 线段树 #include <cstdio>#in