제출 #521460

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
521460		Rasoul006	Doktor (COCI17_doktor)	C++17	10 / 100	1100 ms	11760 KiB

doktor

#include <bits/stdc++.h>

#define endl "\n"

typedef long long ll;

using namespace std;

const int N = 1e6+5;
ll n , a[500009] , suf[500009] , pre[500009] ;
map < ll , ll > mp ;
int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n ;
    for(int i = 1 ; i <= n ; i++){
        cin >> a[i] ;
        if(a[i] == i){
            pre[i]++ ;
            suf[i]++ ; 
        }
    }
    for(int i = 1 ;i <= n ;i++){
        pre[i] += pre[i-1] ;
    }
    for(int i = n ;i >= 1 ; i--){
        suf[i] += suf[i + 1] ; 
    }
    ll mx = 0 ;
    pair < ll , ll > best =  {0 , 0} ;
    for(ll i = 1 ; i <= n ; i++){
        for(int j = i ; j <= n ; j++){
            ll l = i , r = j ;
            ll q = pre[n] - (pre[l - 1] + suf[r + 1] ) ;
    //        cout << l << " " << r << " " ;
    //        cout << pre[a[i] - 1] << " " << pre[n] - pre[r]<< endl ;
            while(r > l){
                q += (a[r] == l) + (a[l] == r) ;
                l++ , r-- ;
            }
            if(l == r){
                q += (a[r] == r) ;
            }
            if(q >= mx){
                mx = q ;
                best = {j , i} ;
            }
        }
    }
    cout << best.first << " "  << best.second ;
    return 0;
}

• 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