Open Credit System

题意:

给一个序列,求ai-aj(i>j)的最大值

思路:

不断更进ai使得ai为最大,也不断更进最大值,注意要先更进最大值.

代码:

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
int n;
int maxn, ans;
int score[100005];
int main() {
	int kase;
	int a;
   	int b;
	scanf("%d", &kase);
	while(kase--) {
		maxn = 0;
		scanf("%d", &n);
		scanf("%d%d", &a, &b);
		maxn = max(a, b);
		ans = a-b;
		for(int i=2; i<n; i++){
			scanf("%d", &b);
			ans = max(ans, maxn-b);
			maxn = max(maxn, b);
		}
		printf("%d\n", ans);
	}
	return 0;
}