제출 #235159

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
235159		Vimmer	Doktor (COCI17_doktor)	C++14	50 / 100	1093 ms	2296 KiB

doktor

#include <bits/stdc++.h>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 500001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;

typedef long double ld;
typedef long long ll;

typedef short int si;


int a[N], ans, L = 1, R = 1;

int main()
{
//    freopen("input4.txt", "r", stdin); freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    for (int i = 1; i <= n; i++) cin >> a[i];

    for (int i = 1; i <= n; i++)
    {
        int l = a[i], r = i;

        if (l > r) swap(l, r);

        if (l == r) continue;

        int md = (r + l) >> 1, kol = 0, len = r - l;

        for (int j = l; j <= md; j++)
        {
            if (j + len == a[j]) kol++;

            if (a[j] == j && len != 1) kol--;

            len -= 2;
        }

        for (int j = md + 1; j <= r; j++)
        {
            len += 2;

            if (j - len == a[j]) kol++;

            if (a[j] == j && len != 1) kol--;
        }

        if (ans < kol) {ans = kol; L = l; R = r;}
    }

    cout << a[L] << " " << a[R] << endl;
}

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