传送门
这个题就是个卡常数(貌似我的电脑太慢了??)
其实就是维护五个前缀和
d1[i]=(d[i]+d1[i-1])%p;
d2[i]=(d2[i+1]+d[i+1])%p;
sum[i]=(sum[i-1]+v[i])%p;
ans1[i]=(ans1[i-1]+(v[i]*d1[i])%p)%p;
ans2[i]=(ans2[i+1]+(v[i]*d2[i])%p)%p;
查询的时候YY一下就好了,可以看我的code
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#define ll long long
using namespace std;
inline int read(){
int x=0,w=1;
char c=0;
for (c=getchar();c<'0'||c>'9';c=getchar()) {if (c=='-') w=-1;}
for (;c>='0'&&c<='9';c=getchar()) x=(x<<3)+(x<<1)+c-'0';
return x*w;
}
inline void write(ll x){
if (!x) putchar('0');else{
char s[25];
int i,j=0;
for (;x>0;x/=10) s[j++]=x%10;
for (i=j-1;i>=0;i--) putchar(s[i]+48);
}
putchar('\n');
}
const int p=19260817;
int n,m;
ll d[200005];
ll d1[200005],d2[200005],v[200005];
ll sum[200005],ans1[200005],ans2[200005];
int main(){
n=read();m=read();
for(int i=2;i<=n;i++){
d[i]=read();
d1[i]=(d[i]+d1[i-1])%p;
}
for(int i=n-1;i>=1;i--){
d2[i]=(d2[i+1]+d[i+1])%p;
}
for(int i=1;i<=n;i++){
v[i]=read();
sum[i]=(sum[i-1]+v[i])%p;
ans1[i]=(ans1[i-1]+(v[i]*d1[i])%p)%p;
}
for(int i=n;i>=1;i--){
ans2[i]=(ans2[i+1]+(v[i]*d2[i])%p)%p;
}
for(int i=1;i<=m;i++){
int x=read(),l=read(),r=read();
if(x<=l){
ll num=ans1[r]-ans1[l-1]+p;
num-=((sum[r]-sum[l-1])*d1[x])%p;
num=(num+p)%p;
write(num);
}
else if(x>=r){
ll num=ans2[l]-ans2[r+1]+p;
num-=((sum[r]-sum[l-1])*d2[x])%p;
num=(num+p)%p;
write(num);
}
else{
ll num1=ans1[r]-ans1[x]+p;
num1-=((sum[r]-sum[x])*d1[x])%p;
num1=(num1+p)%p;
ll num2=ans2[l]-ans2[x]+p;
num2-=((sum[x-1]-sum[l-1])*d2[x])%p;
num2=(num2+p)%p;
write((num1+num2)%p);
}
}
return 0;
}