Submission #1793388
Source Code Expand
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#define REP(i, n) for(LL i = 0;i < n;i++)
#define REPR(i, n) for(LL i = n;i >= 0;i--)
#define FOR(i, m, n) for(LL i = m;i < n;i++)
#define FORR(i, m, n) for(LL i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
typedef pair<int, P> PP;
typedef pair<LL, LP> LPP;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
/*************** using variables ***************/
int n;
int a[100005];
/**********************************************/
int main(){
cin >> n;
REP(i, n){
cin >> a[i];
}
map<int, int> mp;
REP(i, n){
mp[a[i]]++;
mp[a[i]+1]++;
mp[a[i]-1]++;
}
int ans = 0;
for(auto x: mp){
ans = max(ans, x.second);
}
cout << ans << endl;
}
Submission Info
Submission Time |
|
Task |
C - Together |
User |
wheson |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
1221 Byte |
Status |
AC |
Exec Time |
83 ms |
Memory |
5120 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
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 |
18 ms |
640 KB |
1_005.txt |
AC |
31 ms |
640 KB |
1_006.txt |
AC |
31 ms |
640 KB |
1_007.txt |
AC |
36 ms |
640 KB |
1_008.txt |
AC |
83 ms |
5120 KB |