UVa 11078 Ai-Aj(i<j)的最大值

已知序列A0，A1...An-1,使得Ai-Aj(i<j)尽量大

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1e5+100;
int pre[maxn],back[maxn],a[maxn];
int main()
{
	int n,ans,i,j;
	int t;
	scanf("%d",&t);
	while(t--) {
		scanf("%d",&n);
		for(i=1;i<=n;i++) {
			scanf("%d",&a[i]);
		}
		pre[1]=a[1];
		for(i=2;i<=n;i++) pre[i]=max(pre[i-1],a[i]);
		back[n]=a[n];
		for(i=n-1;i>0;i--) back[i]=min(back[i+1],a[i]);
		ans=-99999999;
		for(i=1;i<n;i++) {
			ans=max(ans,pre[i]-back[i+1]);
		}
		printf("%d\n",ans);
	}
	return 0;
}