codeforces 742 div2 E

题目

当时没想到区间合并怎么弄，这个题好好学了一次。

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<sstream>
#include<queue>
#include<list>
#include<bitset>
#include<stack>
#include<bitset>
#include<iomanip> 
#include<set>
#include<cmath>
#include<map>
#include<functional>
#define int long long
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define _BYTE unsigned char
#define HIBYTE(x) (*((_BYTE*)&(x)+1))
#define eps 1e-8
//#define double long double
using namespace std;
int n,q,a[200005];
struct node
{
	int sum,lnum,rnum,llen,rlen,len;//sum就是区间内答案，llen是以最左边为起始点的答案，rlen相反，lnum最左边的数是啥，rnum相反，len是这个结点所属区间的长度 
}t[200005*4];
void pushup(node &rt,node l,node r)
{
	rt.sum=l.sum+r.sum;
	rt.lnum=l.lnum,rt.rnum=r.rnum;
	rt.llen=l.llen,rt.rlen=r.rlen;
	rt.len=l.len+r.len;
	if(l.rnum<=r.lnum)
	{
		rt.sum+=l.rlen*r.llen;
		if(l.llen==l.len)rt.llen+=r.llen;
		if(r.rlen==r.len)rt.rlen+=l.rlen;
	}
}
void build(int rt,int l,int r)
{
	if(l==r)
	{
		t[rt]=(node){1,a[l],a[r],1,1,1};
		return;
	}
	int mid=l+r>>1;
	build(rt*2,l,mid);
	build(rt*2+1,mid+1,r);
	pushup(t[rt],t[rt*2],t[rt*2+1]);
}
void update(int rt,int l,int r,int x,int val)
{
	if(l==r)
	{
		t[rt].lnum=t[rt].rnum=val;
		return;
	}
	int mid=l+r>>1;
	if(x<=mid)
	{
		update(rt*2,l,mid,x,val);
	}
	else
	{
		update(rt*2+1,mid+1,r,x,val);
	}
	pushup(t[rt],t[rt*2],t[rt*2+1]);
}
node ask(int rt,int l,int r,int al,int ar)
{
	if(al<=l&&ar>=r)
	{
		return t[rt];
	}
	int mid=l+r>>1;
	if(ar<=mid)
	{
		return ask(rt*2,l,mid,al,ar);
	}
	else if(al>mid)
	{
		return ask(rt*2+1,mid+1,r,al,ar);
	}
	else
	{
		node ans;
		node ansl=ask(rt*2,l,mid,al,ar);
		node ansr=ask(rt*2+1,mid+1,r,al,ar);
		pushup(ans,ansl,ansr);
		return ans;
	}
}
signed main()
{
	IO;
	cin>>n>>q;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	build(1,1,n);
	while(q--)
	{
		int t,x,y;
		cin>>t>>x>>y;
		if(t==1)
		{
			update(1,1,n,x,y);
		}
		else
		{
			cout<<ask(1,1,n,x,y).sum<<endl;
		}
	}
}