【wikioi2174】 忠诚S

#include<iostream>#include<cstdio>using namespace std;struct tree{int l,r,min;}tr[400001];int n,m,a[100001];void build(int k,int s,int t){tr[k].l=s;tr[k].r=t;if(s==t){tr[k].min=a[s];return;}int mid=(s+t)>>1;build(k<<1,s,mid);build(k<<1|1,mid+1,t);tr[k].min=min(tr[k<<1].min,tr[k<<1|1].min);}int ask(int k,int s,int t){int l=tr[k].l,r=tr[k].r;if(s==l&&t==r)return tr[k].min;int mid=(l+r)>>1;if(t<=mid)return ask(k<<1,s,t);else if(s>mid)return ask(k<<1|1,s,t);else return min(ask(k<<1,s,mid),ask(k<<1|1,mid+1,t));}void update(int k,int s,int t,int x){if(s==t){tr[k].min=a[s];return;}int mid=(s+t)>>1;if(x<=mid)update(k<<1,s,mid,x);else update(k<<1|1,mid+1,t,x);tr[k].min=min(tr[k<<1].min,tr[k<<1|1].min);}void change(int x,int y){a[x]=y;update(1,1,m,x);}int main(){scanf("%d%d",&m,&n);for(int i=1;i<=m;i++)scanf("%d",&a[i]);build(1,1,m);for(int i=1;i<=n;i++){int p,x,y;scanf("%d%d%d",&p,&x,&y);if(p==1){if(i!=n)printf("%d ",ask(1,x,y));elseprintf("%d",ask(1,x,y));}else change(x,y);}}