# UVA - 11078 Open Credit System(维护最小值)

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 gure 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.
SampleInput
3
2
100
20
4
4
3
2
1
4
1
2
3
4
SampleOutput
80
3
-1

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

const int maxn=1e5+5;
int A[maxn];

struct note {
int Min,left,right;
} a[maxn*4];

void init(int i,int l,int r) {
a[i].left=l,a[i].right=r;
if(l==r) {
a[i].Min=A[l];
return;
}
int mid=(l+r)>>1;
init(i<<1,l,mid);
init((i<<1) |1,mid+1,r);
a[i].Min=min(a[i<<1].Min,a[(i<<1)|1].Min);
}

int query(int i,int l,int r) {
if(a[i].left==l&&a[i].right==r) {
return a[i].Min;
}
int mid=(a[i].left+a[i].right)>>1;

if(l>mid)
return query((i<<1) |1,l,r);
else if(mid>=r)
return query(i<<1,l,r);
else
return min(query(i<<1,l,mid),query((i<<1) |1,mid+1,r));
}

int main() {
int n,T;
scanf("%d",&T);
while(T--) {
scanf("%d",&n);
for(int i=1; i<=n; ++i) {
scanf("%d",&A[i]);
}
init(1,1,n);
int ans=A[1]-A[2];
for(int i=1; i<n; ++i) {
ans=max(ans,A[i]-query(1,i+1,n));
}
printf("%d\n",ans);
}
return 0;
}


#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

const int maxn=1e5+5;
int A[maxn];

int main(){
int n,T;
scanf("%d",&T);
while(T--) {
scanf("%d",&n);
for(int i=1; i<=n; ++i) {
scanf("%d",&A[i]);
}
int Min=A[n],ans=A[n-1]-A[n];
for(int i=n-1;i>=1;--i){
ans=max(ans,A[i]-Min);
Min=min(A[i],Min);
}
printf("%d\n",ans);
}
return 0;
}


04-08 707

11-25 578

03-10 625

08-16 536

07-25 1346

04-18 477

04-08 201

11-30 585

11-09 254

09-26 66