【题目】
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 casesT(less than 20). Each case starts with an integernwhich is the number of students in the course. This value can be as large as 100,000 and as low as 2. Nextnlines containnintegers where thei'thinteger
is the score of thei'thstudent. All these integers have absolute values less than 150000. Ifi<j, theni'thstudent is senior to thej'thstudent.
Output
For each testcase,output the desired number in a new line. Follow the format shown in sample input-output section.
Sample InputOutput for Sample Input
3
2
100
20
4
4
3
2
1
4
1
2
3
4
|
80
3
-1
|
Problemsetter: MohammadSajjadHossain
Special Thanks: Shahriar Manzoor
【分析】
【思路一】
最简单的一种就是二重循环。但是Time limit exceeded。 这种算法的时间复杂度为O(n^2)。在n 很大规模的时候就无能为力了。
【思路二】
对于每个固定的j,我们应该选择的是小于j且Ai最大的i,而和Aj的具体数值无关。这样,我们从小到大枚举j,顺便维护Ai的最大值即可。时间复杂度降为O(n)
【代码】
【代码1】
/*********************************
* 日期:2014-5-1
* 作者:SJF0115
* 题号: 11078 - Open Credit System
* 地址:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=22&page=show_problem&problem=2019
* 来源:UVA
* 结果:Time limit exceeded。
* 总结:
**********************************/
#include <iostream>
#include <stdio.h>
using namespace std;
int A[100001];
int main(){
int T,i,j,n;
scanf("%d",&T);
//T组测试数据
while(T--){
scanf("%d",&n);
//输入数据
for(i = 0;i < n;i++){
scanf("%d",&A[i]);
}
//初始化 不要初始化为0因为最终答案可能小于0
int max = A[0] - A[1];
//计算最大的A[i]-A[j]
for(i = 0;i < n;i++){
for(j = i+1;j < n;j++){
if(max < A[i] - A[j]){
max = A[i] - A[j];
}//if
}//for
}//for
printf("%d\n",max);
}
return 0;
}
【代码2】
/*********************************
* 日期:2014-5-1
* 作者:SJF0115
* 题号: 11078 - Open Credit System
* 地址:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=22&page=show_problem&problem=2019
* 来源:UVA
* 结果:Accepted
* 总结:
**********************************/
#include <iostream>
#include <stdio.h>
using namespace std;
int A[100001];
int main(){
int T,i,j,n;
scanf("%d",&T);
//T组测试数据
while(T--){
scanf("%d",&n);
//输入数据
for(i = 0;i < n;i++){
scanf("%d",&A[i]);
}
//初始化 不要初始化为0因为最终答案可能小于0
int max = A[0] - A[1];
//maxAi动态维护A[0],A[1]....A[j-1]的最大值
int maxAi = A[0];
//计算最大的A[i]-A[j]
for(i = 1;i < n;i++){
//更新最大A[i]-A[j]
if(max < maxAi - A[i]){
max = maxAi - A[i];
}
//更新最大元素
if(maxAi < A[i]){
maxAi = A[i];
}
}//for
printf("%d\n",max);
}
return 0;
}
分享到:
相关推荐
开源项目-codingsince1985-UVa#uva-online-judge-solutions-in-golang.zip,两年来每天都在解决一个uva在线裁判问题,算起来…
Algorithm-UVA-Solutions-in-Python.zip,python 3中各种uva(acm)问题的解决方案。,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
UVa接受的解决方案 UVa在线法官-某些问题的解决方案
uva-infovis-group-12
关于决策流程,机器人足球,仿真2D、很有用的啊,大家可以进行参考!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
uva705 Slash Maze 的代码,在UVaOJ上通过
leetcode 2 算法-Java UVa Online Judge(ACM-ICPC Live ...使用:数组、哈希表、链表、二分搜索、动态规划、堆栈、堆、reedy、排序、树 DFS、BFS、图、二分搜索树、递归、记忆、队列、映射等。...Uva-ACM-ICPC
Uva软件测试2015-PT_MA2_2 Zacharopoulos Theologos 吉多·卢皮亚斯(Guido Loupias) 耶勒·范·阿塞玛约恩·亚历山大·格里戈罗夫(Yoan-Alexander Grigorov)
UVA-问题-解决方案这个存储库代表了我对来自 UVA Online Judge ( )、编程竞赛培训手册 ( ) 的许多编程问题的解决方案 ),以及官方 ACM 国际大学生编程竞赛档案( )。 目前,我的大部分解决方案都是用 Java 或 C ...