제출 #82188

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
82188		luciocf	Doktor (COCI17_doktor)	C++14	50 / 100	16 ms	1332 KiB

doktor

#include <bits/stdc++.h>

using namespace std;

const int maxn = 5e3+10;

int num[maxn];

int main(void)
{
	int n;
	cin >> n;

	for (int i = 1; i <= n; i++)
		cin >> num[i];

	int ans = 0, ind1 = num[1], ind2 = num[2];
	for (int i = 1; i <= n; i++)
	{
		if (num[i] < i) continue;

		int aux = 0;
		for (int j = i; j <= num[i]; j++)
			if (num[j]+j == num[i]+i) aux++;

		if (aux > ans)
		{
			ans = aux;
			ind1 = num[i], ind2 = num[num[i]];
		}
	}

	for (int i = n; i >= 1; i--)
	{
		if (num[i] > i) continue;

		int aux = 0;
		for (int j = num[i]; j <= i; j++)
			if (num[j]+j == num[i]+i) aux++;

		if (aux > ans)
		{
			ans = aux;
			ind1 = num[num[i]], ind2 = num[i];
		}
	}

	cout << ind1 << " " << ind2 << "\n";
}

• 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: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10