제출 #1025806

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1025806		vjudge1	Doktor (COCI17_doktor)	C++17	80 / 100	156 ms	41936 KiB

doktor

#include <bits/stdc++.h>

using namespace std;

int main()
{
	int n;
	cin>>n;
	vector<int> len[2*n];
	vector<int> a;
	for (int i=0;i<n;i++)
	{
		int x;
		cin>>x;
		a.push_back(x);
		a.push_back(0);
	}
	for (int i=0;i<2*n-1;i+=2)
	{
		int rc=2*a[i]-2;
		len[(i+rc)/2].push_back((i+rc)/2-min(i,rc));
	}
	int id=0;
	for (int i=0;i<2*n-1;i++)
	{
		if (len[i].size()>len[id].size())
			id=i;
	}
	int mx=0;
	for (int i:len[id])
		mx=max(mx,i);
	if (len[id].empty())
		cout<<"1 1"<<endl;
	else
		cout<<a[id-mx]<<' '<<a[id+mx]<<endl;
	
	return 0;
}

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