线段树min,max的懒标记

最新推荐文章于 2022-09-09 21:04:12 发布

木落淮南，雨晴雲夢

最新推荐文章于 2022-09-09 21:04:12 发布

阅读量121

点赞数

分类专栏：线段树

本文链接：https://blog.csdn.net/lcl1234567890lcl/article/details/118443402

版权

线段树专栏收录该内容

61 篇文章 0 订阅

订阅专栏

P3130 [USACO15DEC]haybalesCounting Haybale P

相当暴力的操作：直接加就可以了hhh

#include <bits/stdc++.h>
#define inf 0x7fffffff
#define ll long long
#define int long long
//#define double long double
//#define double long long
#define re int
//#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
#define pb push_back
#define mk make_pair
#define P pair < int , int >
using namespace std;
const int mod=9901;
//const int inf=1e18;
const int M=1e8;
const int N=2e6+5;//??????.???? 4e8
struct node
{
	int l,r,sum,add,mi;
}e[N];
int n,m;
void pushup(int p)
{
	e[p].sum=e[ls(p)].sum+e[rs(p)].sum;
	e[p].mi=min(e[ls(p)].mi,e[rs(p)].mi);
}
void bulid(int p,int l,int r)
{
	e[p].l=l;e[p].r=r;
	if(l==r)
	{
		scanf("%lld",&e[p].sum);
		e[p].mi=e[p].sum;
		return;
	}
	int mid=(l+r)>>1;
	bulid(ls(p),l,mid);
	bulid(rs(p),mid+1,r);
	pushup(p);
}
void spread(int p)
{
	if(e[p].add)
	{
		e[ls(p)].sum+=(e[ls(p)].r-e[ls(p)].l+1)*e[p].add;
		e[rs(p)].sum+=(e[rs(p)].r-e[rs(p)].l+1)*e[p].add;
		e[ls(p)].mi+=e[p].add;
		e[rs(p)].mi+=e[p].add;
		e[ls(p)].add+=e[p].add;
		e[rs(p)].add+=e[p].add;
		e[p].add=0;
	}
}
void change(int p,int l,int r,int d)
{
	if(l<=e[p].l&&e[p].r<=r)
	{
		e[p].add+=d;
		e[p].mi+=d;
		e[p].sum+=(e[p].r-e[p].l+1)*d;
		return;
	}
	spread(p);
	int mid=(e[p].l+e[p].r)>>1;
	if(l<=mid)  change(ls(p),l,r,d);
	if(mid<r)  change(rs(p),l,r,d);
	pushup(p);
}
int askmi(int p,int l,int r)
{
	if(l<=e[p].l&&e[p].r<=r)  return e[p].mi;
	spread(p);
	int ans=1e18; 
	int mid=(e[p].l+e[p].r)>>1;
	if(l<=mid)  ans=min(ans,askmi(ls(p),l,r));
	if(mid<r)  ans=min(ans,askmi(rs(p),l,r));
	return ans;
}
int asksum(int p,int l,int r)
{
	if(l<=e[p].l&&e[p].r<=r)  return e[p].sum;
	spread(p);
	int ans=0;
	int mid=(e[p].l+e[p].r)>>1;
	if(l<=mid)  ans+=asksum(ls(p),l,r);
	if(mid<r)  ans+=asksum(rs(p),l,r);
	return ans;
}
void solve()
{
	cin>>n>>m;
	bulid(1,1,n);
	while(m--)
	{
		char op[5];
		int x,y,z;
		scanf("%s%lld%lld",op,&x,&y);
		if(op[0]=='M')  printf("%lld\n",askmi(1,x,y));
		if(op[0]=='P')
		{
			scanf("%lld",&z);
			change(1,x,y,z);
		}
		if(op[0]=='S')  printf("%lld\n",asksum(1,x,y));
	}
}
signed main()
{
    int T=1;
//    cin>>T;
    for(int index=1;index<=T;index++)
    {
        solve();
//        puts("");
    }
    return 0;
}
/*


 
*/