257092026-02-27 18:25:27algoproBejgli (80 pont)cpp17Accepted 80/8034ms1264 KiB
// UUID: eb4d2e06-7492-471f-a46e-fca7b1ba040a
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
	vector<int> v(n);
	vector<int> v2(n + 1, 0);
	for (int i = 0; i < n; i++) {
		cin >> v[i];
	}
	int j = 0;
	int count = 0;
	while (j < n) {
		count++;
		v2[v[j]]++;
		j += v[j];
	}
	cout << count << "\n";
	int maxi = 1;
	for (int i = 1; i <= n; i++) {
		if (v2[maxi] < v2[i]) {
			maxi = i;
		}
	}
	cout << maxi;
}

SubtaskSumTestVerdictTimeMemory
base80/80
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted4/41ms316 KiB
4Accepted4/41ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms316 KiB
7Accepted4/41ms316 KiB
8Accepted4/41ms316 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms316 KiB
11Accepted4/41ms384 KiB
12Accepted4/43ms316 KiB
13Accepted4/42ms332 KiB
14Accepted4/43ms472 KiB
15Accepted4/44ms520 KiB
16Accepted4/44ms412 KiB
17Accepted4/412ms800 KiB
18Accepted4/418ms1076 KiB
19Accepted4/426ms1204 KiB
20Accepted4/427ms1264 KiB
21Accepted4/434ms1076 KiB
22Accepted4/420ms1076 KiB