Submission #1606070
Source Code Expand
#include <cstdio> #include <iostream> #include <algorithm> #include <string> #include <cstring> #include <vector> #include <queue> #include <set> #include <map> #include <cmath> #include <iomanip> #include <cassert> #include <bitset> using namespace std; typedef pair<int, int> P; #define rep(i, n) for (int i=0; i<(n); i++) #define all(c) (c).begin(), (c).end() #define uniq(c) c.erase(unique(all(c)), (c).end()) #define _1 first #define _2 second #define pb push_back #define INF 1145141919 #define MOD 1000000007 int N; int C[200000]; signed main() { ios::sync_with_stdio(false); cin.tie(0); cin >> N; rep(i, N) { int a;cin >> a; C[a]++; } int m = 0; for (int X=0; X<=100000; X++) { int t = C[X] + C[X+1]; if (X>0) t += C[X-1]; m = max(m, t); } cout << m << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Together |
User | funcsr |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 864 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 640 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 | 7 ms | 256 KB |
1_005.txt | AC | 9 ms | 256 KB |
1_006.txt | AC | 9 ms | 256 KB |
1_007.txt | AC | 9 ms | 256 KB |
1_008.txt | AC | 9 ms | 640 KB |