Lang:G++
Edit12345678910111213141516171819202122232425262728293031//By Lin#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<set>#include<vector>#include<map>#include<queue>#include<cctype>#include<cmath>#define eps 1e-9#define sqr(x) ((x)*(x))#define Rep(i,n) for(int i = 0; i<n; i++)#define foreach(i,n) for( __typeof(n.begin()) i = n.begin(); i!=n.end(); i++)#define X first#define Y second#define mp(x,y) make_pair(x,y)using namespace std;typedef long long LL;typedef pair<int,int> pii;#define N 200010int n, m;int A[N];struct Segtree {int left[N*4], right[N*4];