Submission #1557436

---

Source Code Expand

/* Written by Filip Hlasek 2017 */
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <iostream>

#define FOR(i, a, b)   for (int i = (a); i <= (b); i++)
#define FORD(i, a, b)  for (int i = (a); i >= (b); i--)
#define REP(i, b)      for (int i =  0 ; i <  (b); i++)

using namespace std;

#define MAXN 111111
int cnt[MAXN];

int main(int argc, char *argv[]) {
  int N;
  scanf("%d", &N);
  REP(i, N) {
    int a;
    scanf("%d", &a);
    cnt[a]++;
  }
  int ans = 0;
  REP(i, MAXN - 1) ans = max(ans, cnt[i] + cnt[i + 1] + cnt[i + 2]);
  printf("%d\n", ans);
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main(int, char**)’:
./Main.cpp:26:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &N);
                  ^
./Main.cpp:29:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &a);
                    ^
./Main.cpp:33:66: warning: iteration 111109u invokes undefined behavior [-Waggressive-loop-optimizations]
   REP(i, MAXN - 1) ans = max(ans, cnt[i] + cnt[i + 1] + cnt[i + 2]);
                                                                  ^
./Main.cpp:17:44: note: containing loop
 #define REP(i, b)      for (int i =  0 ; i <  (b); i++)
                                            ^
./Main.cpp:33:3: note: in expansion of macro ‘REP’
   REP(i, MAXN - 1) ans = max(ans, cnt[i] + cnt[i + 1] + cnt[i + 2]);
   ^

Judge Result