Codeforces Round #333 (Div. 2)-D Lipshitz Sequence（单调栈）

D. Lipshitz Sequence

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A function  is called Lipschitz continuous if there is a real constant K such that the inequality |f(x) - f(y)| ≤ K·|x - y| holds for all . We'll deal with a more... discrete version of this term.

For an array , we define it's Lipschitz constant  as follows:

• if n < 2, 
• if n ≥ 2,  over all 1 ≤ i < j ≤ n

In other words,  is the smallest non-negative integer such that |h[i] - h[j]| ≤ L·|i - j| holds for all 1 ≤ i, j ≤ n.

You are given an array  of size n and q queries of the form [l, r]. For each query, consider the subarray ; determine the sum of Lipschitz constants of all subarrays of .

Input

The first line of the input contains two space-separated integers n and q (2 ≤ n ≤ 100 000 and 1 ≤ q ≤ 100) — the number of elements in array  and the number of queries respectively.

The second line contains n space-separated integers  ().

The following q lines describe queries. The i-th of those lines contains two space-separated integers li and ri (1 ≤ li < ri ≤ n).

Output

Print the answers to all queries in the order in which they are given in the input. For the i-th query, print one line containing a single integer — the sum of Lipschitz constants of all subarrays of .

Examples

input

10 4
1 5 2 9 1 3 4 2 1 7
2 4
3 8
7 10
1 9

output

17
82
23
210

input

7 6
5 7 7 4 6 6 2
1 2
2 3
2 6
1 7
4 7
3 5

output

2
0
22
59
16
8

Note

In the first query of the first sample, the Lipschitz constants of subarrays of  with length at least 2 are:

• 
• 
• 

The answer to the query is their sum.

题意：给你一个序列，再给你q次查询，每次查询一个区间[l,r]中所有子区间的斜率最大值之和。

题解：可以证明一个区间中斜率最大上的点一定是相邻的两点，知道这一点后就很简单了。

先预处理一下所有相邻点的差值，然后求所有的子区间最大值之和用单调栈维护一下就OK了。

#include<set>      
#include<map>         
#include<stack>                
#include<queue>                
#include<vector>        
#include<string>     
#include<time.h>    
#include<math.h>                
#include<stdio.h>                
#include<iostream>                
#include<string.h>                
#include<stdlib.h>        
#include<algorithm>       
#include<functional>        
using namespace std;                
#define ll long long          
#define inf 1000000000           
#define mod 1000000007                
#define maxn  205000    
#define lowbit(x) (x&-x)                
#define eps 1e-9  
int a[maxn],b[maxn],n,q;
struct node
{
	ll x,y;
}s[maxn];
ll solve(int l,int r)
{
	ll ans=0,sum=0,rear=0;
	for(int i=l;i<r;i++)
	{
		int num=1;
		while(rear && s[rear].x<=b[i])
		{
			sum-=s[rear].x*s[rear].y;
			num+=s[rear].y;
			rear--;
		}
		s[++rear].x=b[i];
		s[rear].y=num;
		sum+=(ll)b[i]*num;
		ans+=sum;
	}
	return ans;
}
int main(void)
{
	int i;
	scanf("%d%d",&n,&q);
	for(i=1;i<=n;i++)
		scanf("%d",&a[i]);
	for(i=2;i<=n;i++)
		b[i-1]=abs(a[i]-a[i-1]);
	while(q--)
	{
		int l,r;
		scanf("%d%d",&l,&r);
		printf("%lld\n",solve(l,r));
	}
	return 0;
}