题目:
题意:
1 l r x 将区间[l,r]的元素都+x
2 y 查询序列中是y这个数的坐标的最大差值
题解:
其实很简单,只需要暴力一点,在块内排序二分就好了,总复杂度
O(qn−−√logn)
O
(
q
n
l
o
g
n
)
是可以过的啊
这个数据范围应该是longlong,少开ll毁终生
代码:
#include <cstdio>
#include <cmath>
#include <algorithm>
#define LL long long
using namespace std;
const int inf=1e9;
const int N=500005;
struct hh{LL z;int id;}a[N],b[N];int m,n,cnt,pos[N];LL add[N];
int cmp(hh a,hh b){return a.z<b.z || (a.z==b.z&&a.id<b.id);}
void insert(int x)
{
int l=(x-1)*cnt+1,r=min(n,x*cnt);
for (int i=l;i<=r;i++) b[i]=a[i];
sort(b+l,b+r+1,cmp);
}
void change(int l,int r,LL w)
{
if (pos[l]==pos[r])
{
for (int i=l;i<=r;i++) a[i].z+=w;
insert(pos[l]);
}else
{
int up=min(n,pos[l]*cnt);
for (int i=l;i<=up;i++) a[i].z+=w;
insert(pos[l]);
up=(pos[r]-1)*cnt+1;
for (int i=up;i<=r;i++) a[i].z+=w;
insert(pos[r]);
for (int i=pos[l]+1;i<pos[r];i++) add[i]+=w;
}
}
int findx(int x,LL w)//找到等于w的最小位置
{
int l=(x-1)*cnt+1,r=min(n,x*cnt),ans=0;
while (l<=r)
{
int mid=(l+r)>>1;
if (b[mid].z==w) ans=mid;
if (b[mid].z>=w) r=mid-1;else l=mid+1;
}
if (ans) return b[ans].id;
return inf;
}
int findd(int x,LL w)//找到等于w的最大位置
{
int l=(x-1)*cnt+1,r=min(n,x*cnt),ans=0;
while (l<=r)
{
int mid=(l+r)>>1;
if (b[mid].z==w) ans=mid;
if (b[mid].z<=w) l=mid+1;else r=mid-1;
}
if (ans) return b[ans].id;
return -inf;
}
int ask(LL y)
{
int lx=inf,rx=-inf;
for (int i=1;i<=m;i++)
lx=min(lx,findx(i,y-add[i])),rx=max(rx,findd(i,y-add[i]));
if (lx>rx) return -1;
return rx-lx;
}
int main()
{
freopen("data.in","r",stdin);
int q;scanf("%d%d",&n,&q);
for (int i=1;i<=n;i++) scanf("%I64d",&a[i].z),a[i].id=i;
cnt=sqrt(n);
for (int i=1;i<=n;i++) pos[i]=(i-1)/cnt+1;
m=n/cnt;if (n%cnt) m++;
for (int i=1;i<=m;i++) insert(i);
while (q--)
{
int id,l,r;LL x;
scanf("%d",&id);
if (id==1)
{
scanf("%d%d%I64d",&l,&r,&x);
change(l,r,x);
}else
{
scanf("%I64d",&x);
printf("%d\n",ask(x));
}
}
}