#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int INF = 150000 + 7;
int T, n;
int a, b;
int r[100007];
int main() {
scanf("%d", &T);
while(T--) {
scanf("%d", &n);
memset(r, 0, sizeof(r));
int minn = INF;
int ans = -INF;
for(int i = 0; i < n; ++i)
scanf("%d", &r[i]);
for(int i = n - 1; i >= 0; --i) {
ans = max(ans, r[i] - minn);
minn = min(minn, r[i]);
}
printf("%d\n", ans);
}
return 0;
}
11078 Open Credit System
最新推荐文章于 2016-01-25 21:16:42 发布