Submission #1594366


Source Code Expand

#include <iostream>
#include <cstdio>
#include <map>

using namespace std;
const int maxn = 100000;
int n,a[maxn+1];
map<int,int> M;
int res;
int main()
{
	ios_base::sync_with_stdio(0);
	//freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);
	cin >> n;
	M.clear();
	for (int i=1; i<=n; i++)
	{
		cin >> a[i];
		M[a[i]]++;
		M[a[i]+1]++;
		M[a[i]-1]++;
	}
	res=0;
	for (auto it=M.begin(); it!=M.end(); it++)
	res=max(res,(*it).second);
	cout << res;
	return 0;
}

Submission Info

Submission Time
Task C - Together
User bvd
Language C++14 (GCC 5.4.1)
Score 300
Code Size 505 Byte
Status AC
Exec Time 64 ms
Memory 5120 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 9
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
1_003.txt AC 1 ms 256 KB
1_004.txt AC 8 ms 640 KB
1_005.txt AC 11 ms 640 KB
1_006.txt AC 11 ms 640 KB
1_007.txt AC 14 ms 640 KB
1_008.txt AC 64 ms 5120 KB