해커랭크(HackerRank)
Picking Numbers
cepiloth
2018. 8. 19. 17:32
반응형
1. 문제
2. 알고리즘
키워드 - 구현
3. 코드
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 | #include <bits/stdc++.h> using namespace std; int pickingNumbers(vector <int> a) { // Complete this function sort(a.begin(), a.end()); const int size = a.size(); int solution = 0; for(int i=0; i<size; i++) { int cand = 0; for(int j=i+1; j<size; j++) { int cand2 = abs(a[i] - a[j]); if(cand2 == 1 || cand2 == 0) cand++; else break; } if(solution < cand) { solution = cand; } } return solution+1; } int main() { int n; cin >> n; vector<int> a(n); for(int a_i = 0; a_i < n; a_i++){ cin >> a[a_i]; } int result = pickingNumbers(a); cout << result << endl; return 0; } | cs |
반응형