257602026-03-01 18:00:35algoproBejgli (80 pont)cpp17Accepted 80/8032ms1260 KiB
// UUID: 708ba243-8414-424d-9aaa-da225abbc09b
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, pozicio = 0, darabszam = 0, x; 
	cin >> n;
	vector<int> bejgli(n);
	vector<int> gyakorisag(100001, 0);
	for(int i = 0; i <= n-1; i++){
		cin >> bejgli[i];
	}
	while (pozicio < n){
		x = bejgli[pozicio];
		darabszam++;
		gyakorisag[x]++;
		pozicio = pozicio + x;
	}
	int maxi = 0, maxiindex = 0;
	for(int i = 1; i <= 100000; i++){
		if(maxi < gyakorisag[i]){
			maxi = gyakorisag[i];
			maxiindex = i ;
		}
	}
	cout << darabszam << "\n" << maxiindex;
}
SubtaskSumTestVerdictTimeMemory
base80/80
1Accepted0/01ms748 KiB
2Accepted0/01ms564 KiB
3Accepted4/41ms564 KiB
4Accepted4/41ms564 KiB
5Accepted4/41ms564 KiB
6Accepted4/41ms564 KiB
7Accepted4/42ms564 KiB
8Accepted4/41ms564 KiB
9Accepted4/42ms564 KiB
10Accepted4/42ms564 KiB
11Accepted4/42ms820 KiB
12Accepted4/42ms820 KiB
13Accepted4/43ms820 KiB
14Accepted4/44ms844 KiB
15Accepted4/44ms820 KiB
16Accepted4/44ms820 KiB
17Accepted4/412ms1004 KiB
18Accepted4/418ms1260 KiB
19Accepted4/425ms1076 KiB
20Accepted4/425ms1076 KiB
21Accepted4/432ms1076 KiB
22Accepted4/419ms1076 KiB