Submission #473190

#	Time	Username	Problem	Language	Result	Execution time	Memory
473190		BidoTeima	Doktor (COCI17_doktor)	C++17	10 / 100	1090 ms	2636 KiB

doktor

/// isA AC
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void ACPLS(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
#define tc int tttttt;cin>>tttttt;while(tttttt--)
#define sumrange(l,r,arr) (l==0?arr[r]:arr[r]-arr[l-1])
#define all(v) v.begin(),v.end()
int main(){
    ACPLS(); 
    int n;
    cin>>n;
    int a[n+1];
    int cnt=0;
    bool lol[n+1]={0};
    for(int i = 1; i <= n; i++){
        cin>>a[i];
        if(a[i]==i){
            ++cnt;
            lol[i]=1;
        }
    }
    int ans=0;
    pair<int,int> best={1,1};
    for(int i = 1; i <= n; i++){
        for(int j = i+1; j <= n; j++){
            int res=0;
            for(int k = i; k <= j; k++){
                if(i-j%2==0&&k==(i+j)/2)
                    continue;
                if(lol[k])--res;
                if(a[k]==j-k+i)++res;
            }
            if(res>ans){
                ans=res;
                best={i,j};
            }
        }
    }
    cout<<best.second<<' '<<best.first;
}

• 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