小错误（输入数据）牛客 14683 储物点的距离

不行

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define Mod 1000000007
ll n,m,i,j,x,l,r;
ll s[200050],num[200050],ps[200050];
int main()
{cin>>n>>m;for(int i=1;i<=n;i++){if(i<=n-1) {ll y;cin>>y;s[i+1]=(s[i]+y)%Mod;}ll y;cin>>y;num[i]=(num[i-1]+y)%Mod;ps[i]=(ps[i-1]+(y%Mod*s[i]))%Mod;}while(m--){ll ans=0;cin>>x>>l>>r;if(x<l){ans=(ps[r]-ps[l-1]+Mod)%Mod-s[x]*(num[r]-num[l-1]+Mod)%Mod;}else if(x>=r){ans=s[x]*(num[r]-num[l-1]+Mod)%Mod-(ps[r]-ps[l-1]+Mod)%Mod;}else{ll xl,xr;xl=s[x]*(num[x]-num[l-1]+Mod)%Mod-(ps[x]-ps[l-1]+Mod)%Mod;xr=(ps[r]-ps[x-1]+Mod)%Mod-s[x]*(num[r]-num[x-1]+Mod)%Mod;ans=(xl+xr)%Mod;}cout<<ans<<endl;}return 0;
}

行

#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
typedef long long ll;
#define Mod 1000000007
ll n,i,j,m,x,y,l,r;
ll s[200050],p[200050],ps[200050];//s记录距离前缀和，p记录个数前缀和,ps记录价格前缀和
int main()
{scanf("%lld%lld",&n,&m);for(i=1;i<=n-1;i++){scanf("%lld",&y);s[i+1]=(s[i]+y)%Mod;//前缀和处理}for(i=1;i<=n;i++){scanf("%lld",&y);p[i]=(p[i-1]+y)%Mod;//前缀和处理ps[i]=((y%Mod*s[i]%Mod)%Mod+ps[i-1])%Mod;//前缀和处理}while(m--){ll ans=0;scanf("%lld%lld%lld",&x,&l,&r);if(x<=l){ans=(ps[r]-ps[l-1]+Mod)%Mod-s[x]*(p[r]-p[l-1]+Mod)%Mod;//注意负数Mod!}else if(x>=r){ans=s[x]*(p[r]-p[l-1]+Mod)%Mod-(ps[r]-ps[l-1]+Mod)%Mod;//把上式取反}else{ll xl,xr;xl=s[x]*(p[x]-p[l-1]+Mod)%Mod-(ps[x]-ps[l-1]+Mod)%Mod;//r变xxr=((ps[r]-ps[x-1]+Mod)%Mod-s[x]*(p[r]-p[x-1]+Mod)%Mod);//l变xans+=(xl+xr)%Mod;}printf("%lld\n",(ans+Mod)%Mod);}
}