题意:有n个点在一条线上,每个点最多移动k距离,问通过移动这n个点,最少能形成多少个组,使得每个组至少三个点,且每个点都属于一个组。
解析:先将点按位置排序,设dp[i]为前i个点的最少组数 ,如果不能形成,则dp[i] = INF。
则状态转移方程为
dp[i] = max(dp[i],dp[i-k]+1) (i-k+1...i这k个点构成一组)
用线段树维护序列就能AC
[code]:
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
using namespace std;
const double eps = 1e-7;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5+5;
struct SegTree{
int C[maxn<<2];
void push_up(int rt){
C[rt] = min(C[rt<<1],C[rt<<1|1]);
}
void build(int l,int r,int rt){
if(l == r){
C[rt] = inf;
return;
}
int mid = (l+r)>>1;
build(lson);build(rson);
push_up(rt);
}
void update(int k,int x,int l,int r,int rt){
if(l == r){
C[rt] = x;
return;
}
int mid = (l+r)>>1;
if(k <= mid) update(k,x,lson);
else update(k,x,rson);
push_up(rt);
}
int query(int a,int b,int l,int r,int rt){
if(a <= l && r <= b) return C[rt];
if(l > b||r < a) return inf;
int mid = (l+r)>>1;
return min(query(a,b,lson),query(a,b,rson));
}
}st;
int n,m,a[maxn],dp[maxn];
int main(){
int i,j,cas,T;
scanf("%d",&cas);
for(T = 1;T <= cas;T++){
scanf("%d%d",&n,&m);
for(i = 1;i <= n;i++) scanf("%d",&a[i]);
sort(a+1,a+n+1);
a[0] = -inf;
st.build(0,n,1);
st.update(0,0,0,n,1);
for(i = 1;i <= n;i++){
int j = lower_bound(a,a+i,a[i]-2*m)-a;
if(i-j<=1){
dp[i] = inf;
}else{
dp[i] = st.query(j-1,i-3,0,n,1)+1;
}
st.update(i,dp[i],0,n,1);
}
printf("Case %d: ",T);
if(dp[n]>=inf) puts("-1");
else printf("%d\n",dp[n]);
}
return 0;
}