对于每个固定的j,我们应该选择的是小于j且a[i]最大的i,而且和a[j]的具体数值无关,这样从小到大枚举j顺便维护a[i]的最大值即可
/* ***********************************************
Author :fisty
Created Time :2014/12/23 20:01:05
File Name :uva11078.cpp
************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define MAX_N 100000
int n, a[MAX_N];
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
cin.tie(0);
std::ios::sync_with_stdio(false);
int t;
scanf("%d", &t);
while(t--){
scanf("%d", &n);
for(int i = 0;i < n; i++){
scanf("%d", &a[i]);
}
int ans = a[0] - a[1];
int max_i = a[0];
for(int j = 1;j < n; j++){
ans = max(ans, max_i - a[j]);
max_i = max(max_i, a[j]);
}
printf("%d\n", ans);
}
return 0;
}