区间更新和查询,无非就是换了种思想。可以二分来查一个区间的左区间和有区间是否有大于x的数,然后nlogn完美解决问题!
坑了我一晚上,居然是一个sum的初始化,没初始化完的锅!!!
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<string>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const ll INF=1e18+9;
ll a[100010],node[100010*4],sum[100010*4];
void build(int l,int r,int n)
{
if(l==r){node[n]=a[l];return;}
int mid=(l+r)/2;
build(l,mid,n*2);
build(mid+1,r,n*2+1);
node[n]=max(node[n*2],node[n*2+1]);
}
void pushdown(int n)
{
if(sum[n])
{
sum[n*2]+=sum[n];sum[n*2+1]+=sum[n];
node[n*2]+=sum[n];node[n*2+1]+=sum[n];sum[n]=0;
}
}
void update(int p,int q,int l,int r,int n,ll x)
{
if(p<=l&&q>=r){sum[n]+=x;node[n]+=x;return;}
pushdown(n);
int mid=(l+r)/2;
if(p>mid)update(p,q,mid+1,r,n*2+1,x);
else if(q<=mid)update(p,q,l,mid,n*2,x);
else{update(p,q,l,mid,n*2,x);update(p,q,mid+1,r,n*2+1,x);}
node[n]=max(node[n*2],node[n*2+1]);
}
ll solve(int l,int r,ll x,int n)
{
if(r<l){if(node[n]<x)return INF;else return l;}
if(l==r){if(node[n]<x)return INF;else return l;}
int mid=(l+r)/2;pushdown(n);
if(node[n*2]>=x){return solve(l,mid,x,n*2);}
else if(node[n*2+1]>=x){return solve(mid+1,r,x,n*2+1);}
else return INF;
}
ll query(int p,int q,int l,int r,int n,ll x)
{
if(p<=l&&q>=r)
{
if(node[n]>=x)return solve(l,r,x,n);
else return INF;
}
pushdown(n);int mid=(l+r)/2;
if(p>mid)return query(p,q,mid+1,r,n*2+1,x);
else if(q<=mid)return query(p,q,l,mid,n*2,x);
else return min(query(p,q,l,mid,n*2,x),query(p,q,mid+1,r,n*2+1,x));
}
int main()
{
freopen("in.txt","r",stdin);
//freopen("out1.txt","w",stdout);
int t;scanf("%d",&t);
while(t--)
{
memset(sum,0,sizeof(sum));
int n,qq;scanf("%d%d",&n,&qq);
for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
build(1,n,1);
while(qq--)
{
int op,p,q;ll x;scanf("%d%d%d%lld",&op,&p,&q,&x);
if(op==1){ll ans=query(p,q,1,n,1,x);if(ans==INF)ans=-1;printf("%lld\n",ans);}
else{update(p,q,1,n,1,x);}
}
}
return 0;
}