zoukankan      html  css  js  c++  java
  • 洛谷 P3143 [USACO16OPEN]钻石收藏家Diamond Collector

    题目描述

    Bessie the cow, always a fan of shiny objects, has taken up a hobby of mining diamonds in her spare time! She has collected NN diamonds (N leq 50,000N50,000) of varying sizes, and she wants to arrange some of them in a pair of display cases in the barn.

    Since Bessie wants the diamonds in each of the two cases to be relatively similar in size, she decides that she will not include two diamonds in the same case if their sizes differ by more than KK (two diamonds can be displayed together in the same case if their sizes differ by exactly KK). Given KK, please help Bessie determine the maximum number of diamonds she can display in both cases together.

    奶牛Bessie很喜欢闪亮亮的东西(Baling~Baling~),所以她喜欢在她的空余时间开采钻石!她现在已经收集了N颗不同大小的钻石(N<=50,000),现在她想在谷仓的两个陈列架上摆放一些钻石。

    Bessie想让这些陈列架上的钻石保持相似的大小,所以她不会把两个大小相差K以上的钻石同时放在一个陈列架上(如果两颗钻石的大小差值为K,那么它们可以同时放在一个陈列架上)。现在给出K,请你帮Bessie确定她最多一共可以放多少颗钻石在这两个陈列架上。

    输入输出格式

    输入格式:

    The first line of the input file contains NN and KK (0 leq K leq 1,000,000,0000K1,000,000,000).

    The next NN lines each contain an integer giving the size of one of the

    diamonds. All sizes will be positive and will not exceed 1,000,000,0001,000,000,000.

    输出格式:

    Output a single positive integer, telling the maximum number of diamonds that

    Bessie can showcase in total in both the cases.

    输入输出样例

    输入样例#1:
    7 3
    10
    5
    1
    12
    9
    5
    14
    输出样例#1:
    5

    不明白splay标签怎么来的。。

    打了好长时间splay 最后弃疗了

    正解二分

    屠龙宝刀点击就送

    #include <algorithm>
    #include <cstring>
    #include <cstdio>
    #define N 50005
    using namespace std;
    int n,k,a[N],ans1[N],ans2[N];
    int find_1(int x)
    {
        int l=1,r=n;
        for(int mid;l<=r;)
        {
            mid=(l+r)>>1;
            if(a[mid]<x) l=mid+1;
            else r=mid-1;
        }
        return l;
    }
    int find_2(int x)
    {
        int l=1,r=n;
        for(int mid;l<=r;)
        {
            mid=(l+r)>>1;
            if(a[mid]>x) r=mid-1;
            else l=mid+1; 
        }
        return r;
    }
    inline int max(int a,int b){return a>b?a:b;}
    int Main()
    {
        scanf("%d%d",&n,&k);
        for(int i=1;i<=n;++i) scanf("%d",&a[i]);
        sort(a+1,a+1+n);
        for(int i=1;i<=n;++i)
        {
            ans1[i]=i-find_1(a[i]-k)+1;
            ans2[i]=find_2(a[i]+k)-i+1;
        }
        int ans=0;
        for(int i=1;i<=n;++i)
        {
            ans=max(ans,ans1[i-1]+ans2[i]);
            ans1[i]=max(ans1[i],ans1[i-1]);
        }
        printf("%d
    ",ans);
        return 0;
    }
    int sb=Main();
    int main(int argc,char *argv[]){;}
    我们都在命运之湖上荡舟划桨,波浪起伏着而我们无法逃脱孤航。但是假使我们迷失了方向,波浪将指引我们穿越另一天的曙光。
  • 相关阅读:
    处理MySQL的ibdata1文件过大问题
    关于mysql启动问题---mysqld_safe mysqld from pid file * ended
    mysql数据库指定ip远程访问
    关于access_log 日志文件以及ip、uv和pv的定义
    nginx配置及内核优化详解
    LN : leetcode 746 Min Cost Climbing Stairs
    LN : leetcode 684 Redundant Connection
    LN : leetcode 730 Count Different Palindromic Subsequences
    LN : leetcode 516 Longest Palindromic Subsequence
    LN : leetcode 215 Kth Largest Element in an Array
  • 原文地址:https://www.cnblogs.com/ruojisun/p/7587148.html
Copyright © 2011-2022 走看看