Ultraviolet A-11078-Open Credit System (Application of Efficient Algorithms !!)

Ultraviolet A-11078-Open Credit System (Application of Efficient Algorithms !!)

UV-11078

Open Credit System

Time Limit:3000 MS

Memory Limit:Unknown

64bit IO Format:% Lld & % llu

Submit Status

Description

Problem E
Open Credit System
Input:Standard Input

Output:Standard Output

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 specified sor 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 processing sor 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 whereI'Th integer is the score ofI'Th student. All these integers have absolute values less than 150000. IfI<J, ThenI'Th student is senior toJ'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 Output for Sample Input

3 2 100 20 4 4 3 2 1 4 1 2 3 4

80 3 -1

Problemsetter: Muhammad SajjadHossain

Special Thanks: Shahriar Manzoor

Source

Root: Prominent Problemsetters: Hammad Sajjad Hossain
Root: Competitive Programming 2: This increases the lower bound of Programming Contests. Again (Steven & Felix Halim): Problem Solving Paradigms: Complete Search: Iterative (The Easier Ones)
Root: Competitive Programming 3: The New Lower Bound of Programming Contests (Steven & Felix Halim): Problem Solving Paradigms: Complete Search: Iterative (One Loop, Linear Scan)
Root: aoapc I: Beginning Algorithm Contests -- Training Guide (Rujia Liu): Chapter 1. Algorithm Design: Designing Efficient Algorithms: Examples

AC code:

# Include
 
  
# Include using namespace std; int a [100005], n; int main () {int T; scanf ("% d", & T); while (T --) {scanf ("% d", & n); for (int I = 0; I <n; I ++) scanf ("% d ", & a [I]); int ans = a [0]-a [1]; int Max = a [0]; // The maximum value for (int I = 1; I <n; I ++) {ans = max (ans, Max-a [I]) Before I is dynamically maintained; max = max (a [I], Max);} printf ("% d \ n", ans);} return 0 ;}