在这个题中有两种操作
1、(1,k,s) 找到k的右边离k最近的且大于s的值
2、 (2,k,s) 将k位置的石块改为s个
在这个题中我们可以用线段树去做
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
const int MAX_N=300010;
int N,M;
int flag = -1;
int Tree[MAX_N<<2];
int a[MAX_N];
void Bulid(int l, int r, int rt)
{
if(l == r)
{
scanf("%d",&Tree[rt]);
//cin>>Tree[rt];
return ;
}
int mid = (l + r)>>1;
Bulid(l, mid, rt<<1);
Bulid(mid+1, r, rt<<1|1);
Tree[rt] = max(Tree[rt<<1], Tree[rt<<1|1]);
}
void Quedate(int pos, int val, int l, int r, int rt)
{
if(l == r)
{
Tree[rt] = val;
return ;
}
int mid = (l + r)>>1;
if(pos <= mid ) Quedate(pos, val, l, mid, rt<<1);
else Quedate(pos, val, mid+1, r, rt<<1|1);
Tree[rt] = max(Tree[rt<<1], Tree[rt<<1|1]);
}
int Query(int i, int j, int l, int r, int rt, int s)
{
if(i > r || j < l || Tree[rt] <= s) return -1;
if(l == r){
Tree[rt] = 0; //切记 修改线段树的点的时候 rt已经默认是最终的点
return l;
}
int ans = 0;
int mid = (l + r) / 2;
if(Tree[rt << 1] > s) ans = Query(i,j,l,mid,rt<<1,s);
if(ans <= 0) ans = Query(i,j,mid+1,r,rt<<1|1,s);
Tree[rt] = max(Tree[rt<<1], Tree[rt<<1|1]);
return ans;
}
int main()
{
int k=1;
scanf("%d %d",&N,&M);
Bulid(1,N,1);
while(M--)
{
int a, b, c;
scanf("%d%d%d",&c,&a,&b);
if(c == 1)
{
//flag = -1;
printf("%d\n",Query(a+1, N, 1, N, 1, b));
}
else
{
Quedate(a, b, 1, N, 1);
}
}
return 0;
}