Submission #381377

#	Time	Username	Problem	Language	Result	Execution time	Memory
381377		IldarKA	Doktor (COCI17_doktor)	C++14	70 / 100	624 ms	32492 KiB

doktor

#include <bits/stdc++.h>

using namespace std;
int n, a[500001];
map < pair < int, int >, int > m;
int main(){
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        int len = abs(a[i] - i);
        m[{(len + 1) / 2 + min(a[i], i), max(a[i], i) - (len + 1) / 2}]++;
    }
    int l = -1, r = -1;
    int mx = -1;
    for(auto it : m){
        if(it.second > mx){
            mx = it.second;
            l = it.first.first;
            r = it.first.second;
        }
    }
    int mn = min(l - 1, n - r);
    cout << a[l - mn] << " " << a[r + mn];
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 0 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10