# CF1168 A. Increasing by Modulo

• 如果$A_i\leqslant Last\leqslant A_i+\alpha$，我们可以直接将$A_i$加到$Last$即可
• 如果$A_i>Last$$(A_i+\alpha)\%m\geqslant Last$，我们也可以将$A_i$加到$Last$
• 如果$A_i>Last$$(A_i+\alpha)\%m<Last$，那我们就不对$A_i$操作
• 如果$A_i<Last$$A_i+\alpha<Last$，那无论怎么操作都不可行

/*program from Wolfycz*/
#include<map>
#include<cmath>
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define Fi first
#define Se second
#define ll_inf 1e18
#define MK make_pair
#define sqr(x) ((x)*(x))
#define pii pair<int,int>
#define int_inf 0x7f7f7f7f
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
inline char gc(){
static char buf[1000000],*p1=buf,*p2=buf;
}
template<typename T>inline T frd(T x){
int f=1; char ch=gc();
for (;ch<'0'||ch>'9';ch=gc())	if (ch=='-')    f=-1;
for (;ch>='0'&&ch<='9';ch=gc())	x=(x<<1)+(x<<3)+ch-'0';
return x*f;
}
template<typename T>inline T read(T x){
int f=1; char ch=getchar();
for (;ch<'0'||ch>'9';ch=getchar())	if (ch=='-')	f=-1;
for (;ch>='0'&&ch<='9';ch=getchar())	x=(x<<1)+(x<<3)+ch-'0';
return x*f;
}
inline void print(int x){
if (x<0)	putchar('-'),x=-x;
if (x>9)	print(x/10);
putchar(x%10+'0');
}
const int N=3e5;
int A[N+10],n,m;
bool Check(int x){
int Now=0;
for (int i=1;i<=n;i++){
if (A[i]==Now)	continue;
if (A[i]>Now){
if (A[i]+x<m||(A[i]+x)%m<Now)
Now=A[i];
continue;
}
if (A[i]+x<Now)	return 0;
}
return 1;
}
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);