제출 #473541

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
473541		Beboo44	Doktor (COCI17_doktor)	C++14	10 / 100	173 ms	7316 KiB

doktor

#include <bits/stdc++.h>
using namespace std;
#define all(v)			((v).begin()), ((v).end())
#define sz(v)			((int)((v).size()))
typedef long long ll;
typedef vector<int> vi;
typedef vector<pair<ll , int> > vpli;
typedef set<char> st;
typedef stack<int> s;
typedef deque<int> dq;
typedef queue<int> q;
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0)


int main()
{
   ll n;
   cin>>n;
   vector<ll>v(n);
   for(int i=0; i<n; ++i){
    cin>>v[i];
   }
   ll sum = 1;
   ll maxi=0;
   ll indx=0;
   ll start=0;
   for(int i=1; i<n; ++i){
    if(v[i]==v[i-1]+1){
        ++sum;
    }
    else{
        if(sum>maxi){
            maxi=sum;
            sum=1;
            indx=start;
            start = i;
        }
    }
   }
   if(sum>maxi){
    indx = start;
    maxi=sum;
   }
   if(indx<=n/2){
    cout<<v[indx]<<" "<<v[v[indx]-1];
   }
   else{
    cout<<v[indx+maxi-1]<<" "<<v[indx+maxi-2];
   }






    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