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

原创 2016年08月31日 12:13:42

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

题解:
我太蠢了,只想到了线段树维护最小值,然后for枚举一遍,每次用线段树查最小值。
事实上这道题要求Ai-Aj最大,题目的意思就是如果你枚举Aj,那么Ai这个数就要求是0到j-1里面最大的,所以我们线性维护一遍就行了。
我这里从后面往前面维护,也是一样的。

线段树代码:

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")

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;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

UVa:11078 Open Credit System

这里我是用分治法做的。方法有点像算法导论上求最大连续数组和。 求Ai-Aj最大值。 有三种情况。 1.Ai Aj都位于左段区间 2.Ai Aj都位于右段区间 3.Ai位于左段区间,Aj位于右段区间...
  • kkkwjx
  • kkkwjx
  • 2013年08月16日 22:36
  • 442

UVA-11078 Open Credit System

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

UVa 11078 Open Credit System (序列前后最大差)

11078 - Open Credit System Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com...

【Jason's_ACM_解题报告】Open Credit System

Open Credit System 解题报告

uva11078【RMQ】

#include #include #include #include #include #include #include #include #include #define inf 0x3f3f3...

uva10859 Placing Lampposts (树形dp+求两者最小值方法)

题目链接:点击打开链接 题意:给你一个n个点m条边的无向无环图,在尽量少的节点上放灯,使得所有边都被照亮,每盏灯将照亮以它为一个端点的所有边。在灯的总数最小的前提下,被两盏灯同时照亮的边数应尽量大。...

UVA-10048 Audiophobia(最短路上的最小值,Folyd)

原有的Floyd算法应该是:for(int k = 1;k

uva 12124(最小值最大)

题意:有一个人有b元,要去买零件,有n个零件,零件有不同的种类,名称,价格,质量,要求每种零件买一个,不超过b元钱,让最差质量尽量好,问最差质量是多少。 题解:典型最小值最大,一般用二分法,假设一个...

NWERC 2007 / UVa 12124 Assemble (二分搜索&最小值最大问题)

12124 - Assemble Time limit: 3.000 seconds  http://uva.onlinejudge.org/index.php?option=com_online...

uva 12124 Assemble(二分法->最小值最大化*)

uva 12124 Assemble Recently your team noticed that the computer you use to practice for progr...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:UVA - 11078 Open Credit System(维护最小值)
举报原因:
原因补充:

(最多只允许输入30个字)