【bzoj 4392】 Counting Haybales 【Usaco2015 dec】

Description

Farmer John is trying to hire contractors to help rearrange his farm, but so far all of them have quit when they saw the complicated sequence of instructions FJ wanted them to follow. Left to complete the project by himself, he realizes that indeed, he has made the project perhaps more complicated than necessary. Please help him follow his instructions to complete the farm upgrade.

FJ's farm consists of NN fields in a row, conveniently numbered 1…N1…N. In each field there can be any number of haybales. Farmer John's instructions contain three types of entries:

1) Given a contiguous interval of fields, add a new haybale to each field.

2) Given a contiguous interval of fields, determine the minimum number of haybales in a field within that interval.

3) Given a contiguous interval of fields, count the total number of haybales inside that interval.

农夫约翰打算重修他的农场。他有 N 块土地，连续排列成一行，标号为 1…N。在每块土地上有任意数量的草堆。他可以发出三种指令：
1) 对一个连续区间的土地，每块土地增加相同数量的草堆。
2) 对一个连续区间的土地，输出其中最少的草堆数量。
3) 对一个连续区间的土地，输出草堆数量总数。

第一行两个正整数，N (1≤N≤200,000) 和 Q (1≤Q≤100,000)。
下一行是N个非负整数，最大100,000，表示每块土地上有多少个草堆。
以下Q行，每行一单个大写字母开头(M，P或S)，空格后跟随两个正整数 A 和 B (1≤A≤B≤N), 或者三个正整数 A, B, 和 C (1≤A≤B≤N; 1≤C≤100,000)。当且仅当第一个字母是 P 时，是三个正整数。
当该字母是M，输出区间A…B的最小草堆数。
当该字母是P，在区间A…B，每块土地增加C堆草。
当该字母是M，输出区间A…B的草堆数之和。

每行一个数字，用于响应'M' 或 'S' 命令。

Input

The first line contains two positive integers, N (1≤N≤200,000) and Q (1≤Q≤100,000).

The next line contains N nonnegative integers, each at most 100,000, indicating how many haybales are initially in each field.

Each of the next Q lines contains a single uppercase letter, either M, P or S, followed by either two positive integers AA and BB (1≤A≤B≤N), or three positive integers AA, BB, and CC (1≤A≤B≤N; 1≤C≤100,000). There will be three positive integers if and only if the uppercase letter is P.

If the letter is M, print the minimum number of haybales in the interval of fields from A…B.

If the letter is P, put C new haybales in each field in the interval of fields from A…B.

If the letter is S, print the total number of haybales found within interval of fields from A…B.

Output

A line in the output should appear in response to every 'M' or 'S' entry in FJ's instructions.

Sample Input

4 5
3 1 2 4
M 3 4
S 1 3
P 2 3 1
M 3 4
S 1 3

Sample Output

2
6
3
8

这道题是一个线段树模板题，下面是程序：

#include<stdio.h>
#include<iostream>
#define ll long long
using namespace std;
const int N=200005;
struct treenode{
	int lc,rc;
	ll sum,c,mn;
}t[N<<2];
int k=1;
ll min(ll a,ll b){
	return a<b?a:b;
}
inline void read(ll &s){
	s=0;
	char c=getchar();
	while(c<'0'||c>'9'){
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		s=(s<<3)+(s<<1)+c-'0';
		c=getchar();
	}
}
inline void build(int rt,int l,int r){
	if(l==r){
		read(t[rt].mn);
		t[rt].sum=t[rt].mn;
		t[rt].c=t[rt].lc=t[rt].rc=0;
		return;
	}
	int m=l+r>>1;
	build(t[rt].lc=++k,l,m);
	build(t[rt].rc=++k,m+1,r);
	t[rt].sum=t[t[rt].lc].sum+t[t[rt].rc].sum;
	t[rt].mn=min(t[t[rt].lc].mn,t[t[rt].rc].mn);
}
inline void add(int rt,int l,int r,int a,int b,ll &w){
	t[rt].sum+=(b-a+1)*w;
	if(l==a&&r==b){
		t[rt].mn+=w;
		t[rt].c+=w;
		return;
	}
	int m=l+r>>1;
	if(t[rt].c){
		t[t[rt].lc].c+=t[rt].c;
		t[t[rt].rc].c+=t[rt].c;
		t[t[rt].lc].sum+=(m-l+1)*t[rt].c;
		t[t[rt].rc].sum+=(r-m)*t[rt].c;
		t[t[rt].lc].mn+=t[rt].c;
		t[t[rt].rc].mn+=t[rt].c;
		t[rt].c=0;
	}
	if(b<=m){
		add(t[rt].lc,l,m,a,b,w);
	}
	else{
		if(a>m){
			add(t[rt].rc,m+1,r,a,b,w);
		}
		else{
			add(t[rt].lc,l,m,a,m,w);
			add(t[rt].rc,m+1,r,m+1,b,w);
		}
	}
	t[rt].sum=t[t[rt].lc].sum+t[t[rt].rc].sum;
	t[rt].mn=min(t[t[rt].lc].mn,t[t[rt].rc].mn);
}
inline ll askmn(int rt,int l,int r,int a,int b){
	if(l==a&&r==b){
		return t[rt].mn;
	}
	int m=l+r>>1;
	if(t[rt].c){
		t[t[rt].lc].c+=t[rt].c;
		t[t[rt].rc].c+=t[rt].c;
		t[t[rt].lc].sum+=(m-l+1)*t[rt].c;
		t[t[rt].rc].sum+=(r-m)*t[rt].c;
		t[t[rt].lc].mn+=t[rt].c;
		t[t[rt].rc].mn+=t[rt].c;
		t[rt].c=0;
	}
	if(b<=m){
		return askmn(t[rt].lc,l,m,a,b);
	}
	if(a>m){
		return askmn(t[rt].rc,m+1,r,a,b);
	}
	return min(askmn(t[rt].lc,l,m,a,m),askmn(t[rt].rc,m+1,r,m+1,b));
}
inline ll asksum(int rt,int l,int r,int a,int b){
	if(l==a&&r==b){
		return t[rt].sum;
	}
	int m=l+r>>1;
	if(t[rt].c){
		t[t[rt].lc].c+=t[rt].c;
		t[t[rt].rc].c+=t[rt].c;
		t[t[rt].lc].sum+=(m-l+1)*t[rt].c;
		t[t[rt].rc].sum+=(r-m)*t[rt].c;
		t[t[rt].lc].mn+=t[rt].c;
		t[t[rt].rc].mn+=t[rt].c;
		t[rt].c=0;
	}
	if(b<=m){
		return asksum(t[rt].lc,l,m,a,b);
	}
	if(a>m){
		return asksum(t[rt].rc,m+1,r,a,b);
	}
	return asksum(t[rt].lc,l,m,a,m)+asksum(t[rt].rc,m+1,r,m+1,b);
}
inline char ch(){
	char c=getchar();
	while(c!='M'&&c!='S'&&c!='P'){
		c=getchar();
	}
	return c;
}
inline void out(ll n){
	if(n>9){
		out(n/10);
	}
	putchar(n%10+'0');
}
int main(){
	int n,m,l,r;
	ll w;
	char c;
	scanf("%d%d",&n,&m);
	build(1,1,n);
	while(m--){
		c=ch();
		scanf("%d%d",&l,&r);
		switch(c){
			case 'S':
				out(asksum(1,1,n,l,r));
				putchar('\n');
				break;
			case 'M':
				out(askmn(1,1,n,l,r));
				putchar('\n');
				break;
			case 'P':
				read(w);
				add(1,1,n,l,r,w);
				break;
		}
	}
	return 0;
}