题面:
题意:
现在有
n
n
n 个区间
[
l
i
,
r
i
]
[l_i,r_i]
[li,ri]。
现在要组成一个序列。第
i
i
i 个数
a
i
a_i
ai 从区间
[
l
i
,
r
i
]
[l_i,r_i]
[li,ri] 中选择,要保证
a
b
s
(
a
i
−
a
i
−
1
)
≤
k
abs(a_i-a_{i-1})\le k
abs(ai−ai−1)≤k 。
如果存在这样的序列,求解任意这样的序列。
题解:
代码:
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<queue>
#include<bitset>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<set>
#include<ctime>
#define ui unsigned int
#define ll long long
#define llu unsigned ll
#define ld long double
#define pr make_pair
#define pb push_back
#define lc (cnt<<1)
#define rc (cnt<<1|1)
#define len(x) (t[(x)].r-t[(x)].l+1)
#define tmid ((l+r)>>1)
#define fhead(x) for(int i=head[(x)];i;i=nt[i])
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)>(y)?(y):(x))
using namespace std;
const int inf=0x3f3f3f3f;
const ll lnf=0x3f3f3f3f3f3f3f3f;
const double dnf=1e18;
const double alpha=0.75;
const int mod=1e9+7;
const double eps=1e-8;
const double pi=acos(-1.0);
const int hp=13331;
const int maxn=100100;
const int maxm=100100;
const int maxp=100100;
const int up=1100;
int n,k,l[maxn],r[maxn];
int main(void)
{
int tt;
scanf("%d",&tt);
while(tt--)
{
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
scanf("%d%d",&l[i],&r[i]);
for(int i=2;i<=n;i++)
{
l[i]=max(l[i],l[i-1]-k);
r[i]=min(r[i],r[i-1]+k);
}
for(int i=n-1;i>=1;i--)
{
l[i]=max(l[i],l[i+1]-k);
r[i]=min(r[i],r[i+1]+k);
}
bool flag=false;
for(int i=1;i<=n;i++)
{
if(l[i]>r[i])
{
flag=true;
break;
}
}
if(flag) printf("NO\n");
else
{
printf("YES\n");
for(int i=1;i<=n;i++)
{
if(i!=1) putchar(' ');
printf("%d",l[i]);
}
}
putchar('\n');
}
return 0;
}