BNU10792：沙漠旅行者
#include <stdio.h>#include <algorithm>#include <string.h>using namespace std;long long a[100005];int main(){ int t,n,i,j; long long maxn,r; scanf("%d",&t); while(t--) { maxn = 0; scanf("%d",&n); for(i = 0; i<n; i++) scanf("%lld",&a[i]); for(i = 1; i<n; i++) { r = a[i]-a[i-1]; if(maxn<r) maxn = r; } printf("%lld\n",maxn); } return 0;}
