Submission #1775184
Source Code Expand
#include <iostream> #include <cstdlib> #include <string> #include <vector> #include <algorithm> #include <queue> #include <limits.h> #include <map> #define MAXN 100000 #define Amari 1000000007 #define p pair <int,int> using namespace std; multimap <int, int> ship; int n,m,cnt=0; bool clear = false; vector <int> buckets(100004,0); int main(int argc,char const* argv[]) { cin >> n; int a; long long max=0; for(int i=0;i<n;i++) { cin >> a; buckets[a+2]++; } for(int i=0;i<MAXN+2;i++) { if((buckets[i]+buckets[i+1]+buckets[i+2])>max) {max=(buckets[i]+buckets[i+1]+buckets[i+2]);} } cout << max << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Together |
User | Tendaysago |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 698 Byte |
Status | AC |
Exec Time | 37 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 | 2 ms | 640 KB |
0_001.txt | AC | 2 ms | 640 KB |
0_002.txt | AC | 2 ms | 640 KB |
1_003.txt | AC | 2 ms | 640 KB |
1_004.txt | AC | 20 ms | 640 KB |
1_005.txt | AC | 37 ms | 640 KB |
1_006.txt | AC | 37 ms | 640 KB |
1_007.txt | AC | 37 ms | 640 KB |
1_008.txt | AC | 36 ms | 640 KB |