UVA - 11078 - Open Credit System (高效算法的应用!!)

UVA - 11078

Open Credit System

Time Limit: 3000MS 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 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                             Output for Sample Input

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

80

3

-1


Problemsetter: Mohammad SajjadHossain

Special Thanks: Shahriar Manzoor

Source

Root :: Prominent Problemsetters :: Mohammad 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代码:

#include <cstdio>
#include <algorithm>
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];			//动态维护i之前的最大值
		for(int i = 1; i < n; i++)
		{
			ans = max(ans, Max - a[i]);
			Max = max(a[i], Max);
		}
		printf("%d\n", ans);
	}
	return 0;
} 
时间: 2024-11-05 13:45:51

UVA - 11078 - Open Credit System (高效算法的应用!!)的相关文章

[2016-03-19][UVA][11078][Open Credit System]

时间:2016-03-19 20:58:13 星期六 题目编号:[2016-03-19][UVA][11078][Open Credit System] 题目大意:求一个序列中 Ai - Aj的最大值(i < j) 分析:维护j前面最大的Ai ,更新ans即可 #include <cstdio> #include<algorithm> using namespace std; #define FOR(x,y,z) for(int (x)=(y);(x)<(z);++(x

UVA之11078 - Open Credit System

[题目] 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 professor of

11078 - Open Credit System

11078 - Open Credit System Time limit: 3.000 seconds 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 m

UVA - 11462 - Age Sort (高效算法!!)

11462 Age Sort You are given the ages (in years) of all people of a country with at least 1 year of age. You know that no individual in that country lives for 100 or more years. Now, you are given a very simple task of sorting all the ages in ascendi

Uva----------(11078)Open Credit System

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 professor of such a course h

字符串元素重排高效算法集合

以下各题均有时间复杂度为O(n*n)或以空间换取时间使得时间空间复杂度为O(n)的算法,在此均不考虑. 问题一.字符串移动 字符串为*号和26个字母的任意组合,把*号都移动到最左侧,把字母移到最右侧并保持相对顺序不变,要求时间和空间复杂度最小 .如"afdg**fa**hjfkdsl"变换成"****afdgfahjfkdsl" 此题前后字符串的长度不变,由于最终一边只有'*',另一边为字母,可以设置两个指针fast和slow,当str[fast]不为'*'时,赋值

uva 11651 - Krypton Number System(矩阵快速幂)

题目链接:uva 11651 - Krypton Number System 题目大意:给定进制base,和分数score,求在base进制下,有多少个数的值为score,要求不能有连续相同的数字以及前导0.计算一个数的值即为相邻两位数的平方差和. 解题思路:因为score很大,所以直接dp肯定超时,但是即使对于base=6的情况,每次新添一个数score最大增加25(0-5),所以用dp[i][j]预处理出base平方以内的总数,然后用矩阵快速幂计算. #include <cstdio> #

Open Credit System

Open Credit SystemInput: 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 professor of such a course h

uva 11078

/**  * @brief uva 11078  * @file 11078  * @author mianma  * @created 2014/12/23 16:40  * @edited  2014/12/23 16:40  * @type   * @note  */ #include <string> #include <vector> #include <cstring> #include <map> #include <cstdio>