Submission #1591629
Source Code Expand
#include <vector> #include <algorithm> #include <iostream> #include <cassert> #include <cstdlib> #include <cmath> #include <cstring> #include <cstdio> #include <ctime> #include <map> #include <set> #include <string> #include <cassert> #define INFLL 2000000000000000000 #define INF 2000000000 #define MOD 1000000007 #define PI acos(-1.0) using namespace std; typedef pair <int, int> pii; typedef long long ll; typedef vector <ll> vll; int cnt[10001]; int n; int main() { //freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); cin >> n; int ans = -INF; for (int i = 0; i < n; i++) { int a; cin >> a; cnt[a]++; ans = max(ans, cnt[a]); if (a < 10000) { cnt[a + 1]++; ans = max(ans, cnt[a + 1]); } if (a > 0) { cnt[a - 1]++; ans = max(ans, cnt[a - 1]); } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Together |
User | spiderbatman |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 897 Byte |
Status | RE |
Exec Time | 96 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | RE | 96 ms | 256 KB |
1_003.txt | RE | 95 ms | 256 KB |
1_004.txt | AC | 20 ms | 256 KB |
1_005.txt | RE | 95 ms | 256 KB |
1_006.txt | RE | 95 ms | 256 KB |
1_007.txt | RE | 95 ms | 256 KB |
1_008.txt | RE | 95 ms | 256 KB |