uva11078（开放制学分）

题目：

In an open credit system, the students can choose any course they like, but there is a problem. Some

of the students are more senior than other students. The professor of such a course has found quite a

number of such students who came from senior classes (as if they came to attend the pre requisite course

after passing an advanced course). But he wants to do justice to the new students. So, he is going to

take a placement test (basically an IQ test) to assess the level of difference among the students. He

wants to know the maximum amount of score that a senior student gets more than any junior student.

For example, if a senior student gets 80 and a junior student gets 70, then this amount is 10. Be careful

that we don’t want the absolute value. Help the professor to figure out a solution.

Input

Input consists of a number of test cases T (less than 20). Each case starts with an integer n which is

the number of students in the course. This value can be as large as 100,000 and as low as 2. Next n

lines contain n integers where the i’th integer is the score of the i’th student. All these integers have

absolute values less than 150000. If i < j, then i’th student is senior to the j’th student.

Output

For each test case, output the desired number in a new line. Follow the format shown in sample

input-output section.

Sample Input

3

2

100

20

4

4

3

2

1

4

1

2

3

4

Sample Output

80

3

-1

题意：

给一个长度为n的序列，求Ai - Aj (i < j)的最大值。

ac代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int cas;
cin >> cas;
while(cas--)
{
int n;
cin >> n;
int ans=-100005,mmax,num;
cin >> num;
mmax=num;
for(int i=1;i<n;i++)
{
cin >> num;
ans=max(ans,mmax-num);
mmax=max(mmax,num);
}
cout << ans <<endl;
}
return 0;
}