【Loj 6279】区间加 区间找x的前驱

Loj 6279
其实这题和上题有异曲同工之妙 当然可以用set去维护了 而且能完成更多骚操作
但是本着上题的代码改改就能过的思想
还是拿上题的代码拿来改了
注意特判一下 如果第一个都比你这个v小了 那么你没必要找了
否则upper_bound(arr[i]-1) 得到的地址还要减 1 才是所求的元素
一开始那个建1 放在外面没发现 WA到死

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 100025;
int pos[MAX_N],col[MAX_N],arr[MAX_N],block,n;
vector<int > vt[MAX_N];
void reset(int x)
{
    vector<int > vt_;
    swap(vt[x],vt_);
    for(int i = (x-1)*block+1;i<=min(x*block,n);++i)
        vt[x].push_back(arr[i]);
    sort(vt[x].begin(),vt[x].end());
}
void add(int x,int y,int v)
{
    int st= pos[x]+1,ed = pos[y] - 1;
    for(int i = x;i<=min(pos[x]*block,y);++i)
        arr[i] += v;
    reset(pos[x]);
    if(pos[x]!=pos[y])
    {
        for(int i = (pos[y]-1)*block+1;i<=y;++i)
            arr[i] += v;
        reset(pos[y]);
    }
    for(int i = st;i<=ed;++i)
        col[i]+=v;

}
int query(int x,int y,int v)
{
    int ans = -1,st = pos[x]+1,ed = pos[y]-1;
    for(int i = x;i<=min(pos[x]*block,y);++i)
        if(arr[i]+col[pos[x]]<v) ans = max(ans,arr[i]+col[pos[x]]);
    if(pos[x]!=pos[y])
    {
        for(int i = (pos[y]-1)*block+1;i<=y;++i)
            if(arr[i]+col[pos[y]]<v) ans = max(ans,arr[i]+col[pos[y]]);
    }
    for(int i = st;i<=ed;++i)
    {
        if(vt[i][0]>=v-col[i]) continue;
        ans = max(ans,*(upper_bound(vt[i].begin(),vt[i].end(),v-col[i]-1)-1)+col[i]);
    }
    return ans;
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int opt,x,y,v;scanf("%d",&n);
    block = sqrt(n);
    for(int i = 1;i<=n;++i) scanf("%d",&arr[i]),pos[i] = (i-1)/block+1,vt[pos[i]].push_back(arr[i]);
    for(int i = 1;i<=pos[n];++i)
        sort(vt[i].begin(),vt[i].end());
    for(int i = 1;i<=n;++i)
    {
        scanf("%d%d%d%d",&opt,&x,&y,&v);
        if(opt==1)  printf("%d\n",query(x,y,v));
        else add(x,y,v);
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}