Submission #116933

#TimeUsernameProblemLanguageResultExecution timeMemory
116933FutymyCloneDoktor (COCI17_doktor)C++14
10 / 100
61 ms4316 KiB
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; int n, a[N], cnt[2 * N]; int main(){ scanf("%d", &n); for (int i = 1; i <= n; i++) scanf("%d", &a[i]); for (int i = 1; i <= n; i++) { int x = abs(i - a[i]); if (x & 1) cnt[2 * i - 1 - x]++; else cnt[(i - x / 2) * 2 - 1]++; } int Max = -1, pos = 0; for (int i = 1; i <= 2 * n - 1; i++) if (cnt[i] > Max) Max = cnt[i], pos = i; if (pos & 1) { pos = (pos + 1) / 2; int d = min(pos - 1, n - pos); cout << a[pos - d] << " " << a[pos + d]; } else { pos /= 2; int d = min(pos - 1, n - (pos + 1)); cout << a[pos - d] << " " << a[pos + 1 + d]; } return 0; }

Compilation message (stderr)

doktor.cpp: In function 'int main()':
doktor.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
doktor.cpp:11:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
                                  ~~~~~^~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...