include
include
using namespace std;
const int maxn = 100001;
struct Node
{
int L,R;
long long sum,inc;
};
Node Tree[maxn*3];
void BuildTree(int root,int L,int R)
{
Tree[root].L = L,Tree[root].R = R;
Tree[root].sum = 0,Tree[root].inc = 0;
if(L != R)
{
int mid = (Tree[root].L+Tree[root].R)/2;
BuildTree(2*root,L,mid);
BuildTree(2*root+1,mid+1,R);
}
}
void Insert(int root,int s,int e,int h)
{
if(Tree[root].L == s && Tree[root].R == e)
{
Tree[root].inc += h;
return;
}
Tree[root].sum += (e-s+1)*h;
int mid = (Tree[root].L+Tree[root].R)/2;
if(e <= mid)
Insert(2*root,s,e,h);
else if(s > mid)
Insert(2*root+1,s,e,h);
else
{
Insert(2*root,s,mid,h);
Insert(2*root+1,mid+1,e,h);
}
}
long long Quiry(int root,int l,int r)
{
if(Tree[root].L == l && Tree[root].R == r)
{
return (Tree[root].sum+(r-l+1)*Tree[root].inc);
}
long long inc_value = (r-l+1)*Tree[root].inc;
int mid = (Tree[root].L+Tree[root].R)/2;
if(r <= mid)
return (Quiry(2*root,l,r)+inc_value);
else if(l > mid)
return (Quiry(2*root+1,l,r)+inc_value);
else
{
return(Quiry(2*root,l,mid)+Quiry(2*root+1,mid+1,r)+inc_value);
}
}
char readch()
{
char ch;
while(ch = getchar(),(ch<’A’|| ch > ‘Z’ ));
return ch;
}
int main()
{
int n,m;
scanf(“%d%d”,&n,&m);
BuildTree(1,1,n);
for(int i=1;i<=n;i++)
{
int h;
scanf(“%d”,&h);
Insert(1,i,i,h);
}
for(int i=0;i