Codeforces - Pencils and Boxes

#pragma GCC optimize("-Ofast","-funroll-all-loops")
#include<bits/stdc++.h>
//#define int long long
using namespace std;
const int N=5e5+10;
int n,k,d,a[N],dp[N],sum[N];
inline int ask(int l,int r){return sum[r]-sum[l-1];}
signed main(){cin>>n>>k>>d;for(int i=1;i<=n;i++)   scanf("%d",&a[i]);sort(a+1,a+1+n);for(int i=k;i<=n;i++){sum[i]=sum[i-1];if(a[i]-a[i-k+1]>d)    continue;int l=1,r=i-k+1;while(l<r){int mid=l+r>>1;if(a[i]-a[mid]<=d) r=mid;else l=mid+1;}if(l==1||ask(l-1,i-k)) dp[i]=1;sum[i]+=dp[i];}puts(dp[n]?"YES":"NO");return 0;
}

Codeforces - Pencils and Boxes相关推荐

CodeForces 985 E Pencils and Boxes
Pencils and Boxes 题意: n支铅笔,每只笔有一个颜色值, 无限个盒子, 如果一个盒子里面放笔的话, 就至少需要k支笔装在一起,并且一个盒子里面的笔的颜色值只差不能大于 d.如果满足 ...
CodeForces 985E Pencils and Boxes
Description Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives ...
codeforces contest 985E. Pencils and Boxes+思维
类似指针的想法 E. Pencils and Boxes time limit per test 2 seconds memory limit per test 256 megabytes input ...
CodeForces - 985E Pencils and Boxes
可以证明的是,总是存在一种最优策略使得每个组内的权值都是连续的. 所以排完序一遍 two pointers就好啦. Discription Mishka received a gift of mult ...
E. Pencils and Boxes codeforces(思维+dp)
题目链接:E. Pencils and Boxes 题意: 给出n个数字,分组,每组大小>=k,并且同一组内任意两个数字大小不能超过d 思路: 先从小到大排序.然后dp.起点肯定是第一个数字,然 ...
Codeforces 985 E - Pencils and Boxes
E - Pencils and Boxes 思路: dp 先排个序,放进一个袋子里的显然是一段区间定义状态:pos[i]表示小于等于i的可以作为(放进一个袋子里的)一段区间起点的离i最近的位置显然 ...
E. Pencils and Boxes(尺取dp)
E. Pencils and Boxes(尺取&dp) 显然按val排序,然后考虑dp,显然转移的jjj随iii增加不会递减,接着考虑限制条件,显然i往右走,要是差值小于d,i递增, 因为有k ...
【CodeForces 1255E1 --- Send Boxes to Alice [Easy Version]】
[CodeForces 1255E1 --- Send Boxes to Alice [Easy Version]] Description This is the easier version of ...
cf 985E Pencils and Boxes
一原题 E. Pencils and Boxes time limit per test 2 seconds memory limit per test 256 megabytes input st ...

Codeforces - Pencils and Boxes

题目链接：Codeforces - Pencils and Boxes

Codeforces - Pencils and Boxes相关推荐

最新文章

热门文章