zoukankan      html  css  js  c++  java
  • HDU

    Alice are given an array A[1..N]A[1..N] with NN numbers. 

    Now Alice want to build an array BB by a parameter KK as following rules: 

    Initially, the array B is empty. Consider each interval in array A. If the length of this interval is less than KK, then ignore this interval. Otherwise, find the KK-th largest number in this interval and add this number into array BB. 

    In fact Alice doesn't care each element in the array B. She only wants to know the MM-th largest element in the array BB. Please help her to find this number.

    InputThe first line is the number of test cases. 

    For each test case, the first line contains three positive numbers N(1N105),K(1KN),MN(1≤N≤105),K(1≤K≤N),M. The second line contains NN numbers Ai(1Ai109)Ai(1≤Ai≤109). 

    It's guaranteed that M is not greater than the length of the array B. 
    OutputFor each test case, output a single line containing the MM-th largest element in the array BB.Sample Input

    2
    5 3 2
    2 3 1 5 4
    3 3 1
    5 8 2

    Sample Output

    3
    2

    题意:把所有区间从小到大的第K大取出来再排序,求第M大。

    思路:把所有数拿进去二分,大于等于M的数则check成功,R=Mid+1; 尺取。

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    long long n,k,m,a[100010],b[100010],T,ans; 
    inline bool pd(long long x){
        int cnt=0;long long tot=0;
        for(register int i=1,j=1;i<=n;i++){
            while(cnt<k&&j<=n)cnt+=a[j++]>=x;
            if(cnt<k)break;
            tot+=n-j+2;
            cnt-=a[i]>=x;
        }
        return tot>=m;
    }
    int main(){
        for(scanf("%lld",&T);T--;){
            scanf("%lld%lld%lld",&n,&k,&m);ans=0;
            for(register int i=1;i<=n;i++)scanf("%lld",a+i),b[i]=a[i];
            sort(b+1,b+1+n);
            long long l=1,r=n,mid;
            while(l<=r){
                mid=(l+r)>>1;
                if(pd(b[mid]))ans=mid,l=mid+1;
                else r=mid-1;
            }
            printf("%lld
    ",b[ans]);
        }
        return 0;
    }
  • 相关阅读:
    6174问题
    阶乘的精确值
    小学生算术
    Primer回顾 数组和指针
    Primer回顾 标准库类型
    绪论
    字符串的存储
    条款39:明智而审慎的使用private继承
    条款34:区分接口继承和实现继承
    条款33:避免遮掩继承而来的名称
  • 原文地址:https://www.cnblogs.com/hua-dong/p/9696915.html
Copyright © 2011-2022 走看看