제출 #235118

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
235118		kartel	Doktor (COCI17_doktor)	C++14	10 / 100	1093 ms	6136 KiB

doktor

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +500500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int ps[N], a[N], sf[N], kol, i, n, ans, le, ri;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");
    cin >> n;
    for (i = 1; i <= n; i++)
    {
        cin >> a[i];
        ps[a[i]] = i;
    }

    for (i = n; i >= 1; i--) sf[i] = sf[i + 1] + (a[i] == i);

    for (i = 1; i <= n; i++)
    {
        int l = i, L = l;
        int r = ps[i];
        int len = r - l + 1;
        int kl = sf[r + 1];
        int pos = 1;

        for (; l <= r; l++, pos++)
            if (a[l] == i + len - pos) kl++;

        kl += kol;

        if (kl > ans)
        {
            ans = kl;
            le = L;

            ri = r;
        }

        if (a[i] == i) kol++;
    }
    cout << ri << " " << le;
}

//110000
//110000
//001100
//001100
//000011

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