题目描述
给定:
两个长度为n的数列A 、B
一个有m个元素的集合K
询问Q次
每次询问[l,r],输出区间内满足|Bi-Bj|∈K 的最大Ai+Aj
解题思路
注意这题M的范围是10
离线一下,对于每个新加的元素用树状数组暴力维护就可以了。
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=100005;
struct jz{
int L,R,id;
bool operator<(const jz &b)const{return L>b.L;}
}q[maxn];
int m,K[maxn],n,Q,a[maxn],b[maxn],ans[maxn],s[maxn],w[maxn];
bool vis[maxn];
inline int _read(){
int num=0;char ch=getchar();
while(ch<'0'||ch>'9') ch=getchar();
while(ch>='0'&&ch<='9') num=num*10+ch-48,ch=getchar();
return num;
}
int lowbit(int x){return x&(-x);}
void change(int x,int y){for (;x<=n;x+=lowbit(x)) s[x]=max(s[x],y);}
int ask(int x){int num=0;for (;x;x-=lowbit(x)) num=max(num,s[x]);return num;}
void put(int x){
vis[b[x]]=1;w[b[x]]=x;
for (int i=1;i<=m;i++){
if (b[x]-K[i]>=1&&vis[b[x]-K[i]]) change(w[b[x]-K[i]],a[x]+a[w[b[x]-K[i]]]);
if (b[x]+K[i]<=n&&vis[b[x]+K[i]]) change(w[b[x]+K[i]],a[x]+a[w[b[x]+K[i]]]);
}
}
int main(){
freopen("exam.in","r",stdin);
freopen("exam.out","w",stdout);
n=_read();Q=_read();m=_read();
for (int i=1;i<=n;i++) a[i]=_read();
for (int i=1;i<=n;i++) b[i]=_read();
for (int i=1;i<=m;i++) K[i]=_read();
for (int i=1;i<=Q;i++) q[i].L=_read(),q[i].R=_read(),q[i].id=i;
sort(q+1,q+1+Q);
int now=1;
//for (int i=1;i<=Q;i++) printf("%d %d %d\n",q[i].id,q[i].L,q[i].R);
for (int i=n;i>=1;i--){
put(i);
while(now<=Q&&q[now].L==i) ans[q[now].id]=ask(q[now].R),now++;
}
for (int i=1;i<=Q;i++) printf("%d\n",ans[i]);
return 0;
}