Submission #1692324

---

Source Code Expand

#include<cstdio>
#include<algorithm>
using namespace std;
inline char tc(void){
	static char fl[10000],*A=fl,*B=fl;
	return A==B&&(B=(A=fl)+fread(fl,1,10000,stdin),A==B)?EOF:*A++;
}
inline int read(void){
	int a=0;static char c;
	while((c=tc())<'0'||c>'9');
	while(c>='0'&&c<='9')a=a*10+c-'0',c=tc();
	return a;
}
int n,a[100005],pre,nxt,ans;
int main(void){
	register int i;
	n=read();
	for(i=1;i<=n;++i)
		++a[read()];
	pre=0,nxt=a[1];
	for(i=0;i<=1e5;pre=a[i],++i,nxt=a[i+1])
		if(a[i]+pre+nxt>ans)ans=a[i]+pre+nxt;
	printf("%d",ans);
	return 0;
}

Submission Info

Judge Result