Submission #235132

#	Time	Username	Problem	Language	Result	Execution time	Memory
235132		NONAME	Doktor (COCI17_doktor)	C++17	30 / 100	1098 ms	4296 KiB

doktor

#include <bits/stdc++.h>
#define N 5 * 100500
using namespace std;

int n, pf[N], a[N], ans, al = 0, ar = 0;

int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		a[i]--;
		pf[i] = (i - 1 < 0) ? 0 : pf[i - 1];
		
		pf[i] += (a[i] == i);	
	}
	
	for (int i = 0; i < n; i++) {	
		int l = i, r = a[i];
		
		if (l > r)
			swap(l, r);
			
		int cur = ((l - 1 < 0) ? 0 : pf[l - 1]) + (pf[n - 1] - pf[r]);
		
		while (l < r) {
			cur += (a[l] == r);
			cur += (a[r] == l);
			
			l++, r--;	
		}
		
		if (l == r && a[l] == l)
			cur++;
			
		if (cur > ans) {
			ans = cur;
			al = i;
			ar = a[i];
		}
	}
	
	cout << a[al] + 1 << ' ' << a[ar] + 1;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 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