UVA - 11078 Open Credit System

题目传送门

#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#define MAXN 200000
using namespace std;
int argv[MAXN];
int main(void)
{
	int T;
	int n;

	scanf("%d", &T);
	while (scanf("%d", &n) != EOF)
	{
		for (int i = 0; i < n; i++)scanf("%d", &argv[i]);
		int ans = argv[0] - argv[1];
		int max_num = argv[0];

		for (int i = 1; i < n; i++)//这里的i不从0开始，因为i为0就不可能是负数了
		{//反正max_num在一直的变大，所以一直先后推，如果argv[i]小，那就会出现最大，因为i<j
			ans = max(ans, max_num-argv[i]);
			max_num = max(max_num, argv[i]);
		}
		printf("%d\n", ans);
	}

	return 0;
}