常见优化技巧——Diamond Collector S

[USACO16OPEN] Diamond Collector S

题目描述

Bessie the cow, always a fan of shiny objects, has taken up a hobby of mining diamonds in her spare time! She has collected $N$ diamonds ($N\le 50,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 $K$ (two diamonds can be displayed together in the same case if their sizes differ by exactly $K$). Given $K$, 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 $N$ and $K$ ($0\le K\le 1,000,000,000$).

The next $N$ 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,000$.

输出格式

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

Bessie can showcase in total in both the cases.

样例 #1

样例输入 #1

7 3
10
5
1
12
9
5
14

样例输出 #1

5

思路

• 这道题目有两个陈列架，所以找出一个最大的是不行的，而且找出次大的和最大的加起来也是不可行的，因为不保证最大和次大的区间不重叠，所以可以正序扫一遍然后找出到每一个点之前最长的差小于等于k的序列然后再倒序找一遍找出到每一个点之后最长的差小于等于k的序列，细节：在某点之前和之后是不包括自己的，排序完了之后一般双指针无需写限制条件，对于两个陈列架之类的题，我们可以分成两部分来进行维护k区间的方法

代码

#include<iostream>
#include<algorithm>
#include<unordered_map>

using namespace std;

typedef long long LL;

const int N = 1e6+10;
//题目有两个陈列架
int w[N];
int n,m,k;
int q[N],h[N];

int main(){
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>w[i];
    }
    
    sort(w+1,w+1+n);
    int res=0;
    q[1]=h[1]=1;
    for(int i=2,j=1;i<=n;i++){
        while(w[i]-w[j]>k)j++;//一般排好序后不需要写限制条件
        q[i]=max(q[i-1],i-j+1);
    }
    //第二个陈列架
    for(int i=n-1,j=n;i>=1;i--){
        while(w[j]-w[i]>k)j--;
        h[i]=max(h[i+1],j-i+1);
    }
    
    
    for(int i=1;i<n;i++){
        res=max(res,h[i+1]+q[i]);
    }
    cout<<res;
    
    return 0;
}